TY - BOOK TI - Advances and Novel Approaches in Discrete Optimization SN - 9783039432226 PY - 2020/// CY - Basel, Switzerland PB - MDPI - Multidisciplinary Digital Publishing Institute KW - Mathematics & science KW - bicssc KW - Research & information: general KW - ABC4 index KW - algorithm KW - AND/OR tree KW - approximation algorithm KW - arithmetic mean KW - balaban index KW - batch scheduling KW - batching scheduling KW - bi-criteria scheduling KW - bin packing KW - branch and bound KW - capacitated lot sizing KW - combinatorial generation KW - combinatorial optimization KW - competitive ratio KW - contraflow configuration KW - crossing number KW - cyclic permutation KW - deep learning KW - degree of vertex KW - divisible numbers KW - dual problem KW - due-date KW - dynamic flow KW - dynamic programming KW - embedded systems KW - Euler-Catalan's triangle KW - evacuation planning KW - extended adjacency index KW - forgotten index KW - FPGA KW - FPTAS KW - GA5 index KW - genetic algorithm KW - graph KW - Harris hawks optimizer KW - HDN3(m) KW - inventory KW - inverse problem KW - irregular 3D objects KW - job families KW - job-shop KW - join product KW - labeled Dyck path KW - lateness KW - linear deterioration KW - LNS KW - load frequency control KW - logistic supports KW - machine non-availability KW - makespan KW - makespan criterion KW - Max-cut problem KW - maximum machine cost KW - meta-heuristics KW - method KW - minimization of maximum penalty KW - mixed integer formulation KW - n/a KW - network optimization KW - nonlinear optimization KW - numerical conversion KW - online algorithm KW - operator non-availability KW - packing KW - partial lane reversals, algorithms and complexity KW - particle swarm optimization KW - pointer network KW - quasi-phi-function s KW - ranking algorithm KW - reclassified the zagreb indices KW - reinforcement learning KW - release-time KW - retail KW - RHDN3(m) KW - RISC KW - scheduling KW - scheduling algorithm KW - scheduling with rejection KW - sensitivity analysis KW - shortages KW - single-machine scheduling KW - smart grid KW - supervised learning KW - THDN3(m) KW - time complexity KW - total weighted completion time KW - Transportation KW - unary NP-hard KW - uncertain processing times KW - unranking algorithm N1 - Open Access N2 - Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled 'Advances and Novel Approaches in Discrete Optimization'. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms UR - https://directory.doabooks.org/handle/20.500.12854/69200 UR - https://mdpi.com/books/pdfview/book/2972 ER -