|
|
|
|
LEADER |
04991nma a2201441 u 4500 |
001 |
EB001992550 |
003 |
EBX01000000000000001155452 |
005 |
00000000000000.0 |
007 |
cr||||||||||||||||||||| |
008 |
210512 ||| eng |
020 |
|
|
|a books978-3-03943-223-3
|
020 |
|
|
|a 9783039432226
|
020 |
|
|
|a 9783039432233
|
100 |
1 |
|
|a Werner, Frank
|
245 |
0 |
0 |
|a Advances and Novel Approaches in Discrete Optimization
|h Elektronische Ressource
|
260 |
|
|
|a Basel, Switzerland
|b MDPI - Multidisciplinary Digital Publishing Institute
|c 2020
|
300 |
|
|
|a 1 electronic resource (354 p.)
|
653 |
|
|
|a evacuation planning
|
653 |
|
|
|a partial lane reversals, algorithms and complexity
|
653 |
|
|
|a network optimization
|
653 |
|
|
|a bin packing
|
653 |
|
|
|a total weighted completion time
|
653 |
|
|
|a scheduling algorithm
|
653 |
|
|
|a irregular 3D objects
|
653 |
|
|
|a genetic algorithm
|
653 |
|
|
|a scheduling
|
653 |
|
|
|a balaban index
|
653 |
|
|
|a machine non-availability
|
653 |
|
|
|a algorithm
|
653 |
|
|
|a divisible numbers
|
653 |
|
|
|a Max-cut problem
|
653 |
|
|
|a deep learning
|
653 |
|
|
|a load frequency control
|
653 |
|
|
|a maximum machine cost
|
653 |
|
|
|a combinatorial optimization
|
653 |
|
|
|a release-time
|
653 |
|
|
|a makespan
|
653 |
|
|
|a ranking algorithm
|
653 |
|
|
|a uncertain processing times
|
653 |
|
|
|a contraflow configuration
|
653 |
|
|
|a competitive ratio
|
653 |
|
|
|a crossing number
|
653 |
|
|
|a job-shop
|
653 |
|
|
|a extended adjacency index
|
653 |
|
|
|a arithmetic mean
|
653 |
|
|
|a reinforcement learning
|
653 |
|
|
|a scheduling with rejection
|
653 |
|
|
|a cyclic permutation
|
653 |
|
|
|a Research & information: general / bicssc
|
653 |
|
|
|a reclassified the zagreb indices
|
653 |
|
|
|a lateness
|
653 |
|
|
|a pointer network
|
653 |
|
|
|a nonlinear optimization
|
653 |
|
|
|a method
|
653 |
|
|
|a meta-heuristics
|
653 |
|
|
|a operator non-availability
|
653 |
|
|
|a Transportation
|
653 |
|
|
|a labeled Dyck path
|
653 |
|
|
|a unranking algorithm
|
653 |
|
|
|a linear deterioration
|
653 |
|
|
|a Harris hawks optimizer
|
653 |
|
|
|a makespan criterion
|
653 |
|
|
|a minimization of maximum penalty
|
653 |
|
|
|a particle swarm optimization
|
653 |
|
|
|a supervised learning
|
653 |
|
|
|a capacitated lot sizing
|
653 |
|
|
|a ABC4 index
|
653 |
|
|
|a batching scheduling
|
653 |
|
|
|a Euler-Catalan's triangle
|
653 |
|
|
|a shortages
|
653 |
|
|
|a graph
|
653 |
|
|
|a FPTAS
|
653 |
|
|
|a Mathematics & science / bicssc
|
653 |
|
|
|a FPGA
|
653 |
|
|
|a approximation algorithm
|
653 |
|
|
|a n/a
|
653 |
|
|
|a due-date
|
653 |
|
|
|a retail
|
653 |
|
|
|a quasi-phi-function s
|
653 |
|
|
|a unary NP-hard
|
653 |
|
|
|a packing
|
653 |
|
|
|a embedded systems
|
653 |
|
|
|a time complexity
|
653 |
|
|
|a GA5 index
|
653 |
|
|
|a numerical conversion
|
653 |
|
|
|a dynamic programming
|
653 |
|
|
|a job families
|
653 |
|
|
|a branch and bound
|
653 |
|
|
|a THDN3(m)
|
653 |
|
|
|a bi-criteria scheduling
|
653 |
|
|
|a join product
|
653 |
|
|
|a sensitivity analysis
|
653 |
|
|
|a smart grid
|
653 |
|
|
|a degree of vertex
|
653 |
|
|
|a batch scheduling
|
653 |
|
|
|a LNS
|
653 |
|
|
|a inventory
|
653 |
|
|
|a dual problem
|
653 |
|
|
|a RISC
|
653 |
|
|
|a forgotten index
|
653 |
|
|
|a single-machine scheduling
|
653 |
|
|
|a logistic supports
|
653 |
|
|
|a combinatorial generation
|
653 |
|
|
|a HDN3(m)
|
653 |
|
|
|a dynamic flow
|
653 |
|
|
|a inverse problem
|
653 |
|
|
|a RHDN3(m)
|
653 |
|
|
|a mixed integer formulation
|
653 |
|
|
|a online algorithm
|
653 |
|
|
|a AND/OR tree
|
700 |
1 |
|
|a Werner, Frank
|
041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
989 |
|
|
|b DOAB
|a Directory of Open Access Books
|
500 |
|
|
|a Creative Commons (cc), https://creativecommons.org/licenses/by/4.0/
|
028 |
5 |
0 |
|a 10.3390/books978-3-03943-223-3
|
856 |
4 |
0 |
|u https://www.mdpi.com/books/pdfview/book/2972
|7 0
|x Verlag
|3 Volltext
|
856 |
4 |
2 |
|u https://directory.doabooks.org/handle/20.500.12854/69200
|z DOAB: description of the publication
|
082 |
0 |
|
|a 000
|
082 |
0 |
|
|a 500
|
082 |
0 |
|
|a 658
|
082 |
0 |
|
|a 380
|
082 |
0 |
|
|a 700
|
520 |
|
|
|a 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.
|