Advances and Novel Approaches in Discrete Optimization
Material type:
TextLanguage: English Publication details: Basel, Switzerland MDPI - Multidisciplinary Digital Publishing Institute 2020Description: 1 online resource (354 p.)Content type: - text
- computer
- online resource
- 9783039432226
- 9783039432233
- books978-3-03943-223-3
- Mathematics & science
- Research & information: general
- ABC4 index
- algorithm
- AND/OR tree
- approximation algorithm
- arithmetic mean
- balaban index
- batch scheduling
- batching scheduling
- bi-criteria scheduling
- bin packing
- branch and bound
- capacitated lot sizing
- combinatorial generation
- combinatorial optimization
- competitive ratio
- contraflow configuration
- crossing number
- cyclic permutation
- deep learning
- degree of vertex
- divisible numbers
- dual problem
- due-date
- dynamic flow
- dynamic programming
- embedded systems
- Euler-Catalan's triangle
- evacuation planning
- extended adjacency index
- forgotten index
- FPGA
- FPTAS
- GA5 index
- genetic algorithm
- graph
- Harris hawks optimizer
- HDN3(m)
- inventory
- inverse problem
- irregular 3D objects
- job families
- job-shop
- join product
- labeled Dyck path
- lateness
- linear deterioration
- LNS
- load frequency control
- logistic supports
- machine non-availability
- makespan
- makespan criterion
- Max-cut problem
- maximum machine cost
- meta-heuristics
- method
- minimization of maximum penalty
- mixed integer formulation
- n/a
- network optimization
- nonlinear optimization
- numerical conversion
- online algorithm
- operator non-availability
- packing
- partial lane reversals, algorithms and complexity
- particle swarm optimization
- pointer network
- quasi-phi-function s
- ranking algorithm
- reclassified the zagreb indices
- reinforcement learning
- release-time
- retail
- RHDN3(m)
- RISC
- scheduling
- scheduling algorithm
- scheduling with rejection
- sensitivity analysis
- shortages
- single-machine scheduling
- smart grid
- supervised learning
- THDN3(m)
- time complexity
- total weighted completion time
- Transportation
- unary NP-hard
- uncertain processing times
- unranking algorithm
Open Access Unrestricted online access star
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.
Creative Commons https://creativecommons.org/licenses/by/4.0/ cc
https://creativecommons.org/licenses/by/4.0/
English
There are no comments on this title.