Advances and Novel Approaches in Discrete Optimization
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 spectr...
Đã lưu trong:
| Định dạng: | Online |
|---|---|
| Ngôn ngữ: | Tiếng Anh |
| Được phát hành: |
MDPI - Multidisciplinary Digital Publishing Institute
2021
|
| Những chủ đề: | |
| Truy cập trực tuyến: | ONIX_20210501_9783039432226_946 |
| Các nhãn: |
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
|
| _version_ | 1869520818281644032 |
|---|---|
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-69200 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-692002024-03-28T03:32:19Z Advances and Novel Approaches in Discrete Optimization Werner, Frank forgotten index balaban index reclassified the zagreb indices ABC4 index GA5 index HDN3(m) THDN3(m) RHDN3(m) degree of vertex extended adjacency index scheduling with rejection machine non-availability operator non-availability dynamic programming FPTAS Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm bi-criteria scheduling online algorithm makespan maximum machine cost competitive ratio network optimization dynamic flow evacuation planning contraflow configuration partial lane reversals, algorithms and complexity logistic supports scheduling algorithm release-time due-date divisible numbers lateness bin packing time complexity batch scheduling linear deterioration job families Max-cut problem combinatorial optimization deep learning pointer network supervised learning reinforcement learning capacitated lot sizing mixed integer formulation retail inventory shortages graph join product crossing number cyclic permutation arithmetic mean combinatorial generation method algorithm AND/OR tree Euler–Catalan’s triangle labeled Dyck path ranking algorithm unranking algorithm Harris hawks optimizer load frequency control sensitivity analysis smart grid particle swarm optimization genetic algorithm meta-heuristics packing irregular 3D objects quasi-phi-function s nonlinear optimization single-machine scheduling minimization of maximum penalty dual problem inverse problem branch and bound LNS numerical conversion RISC FPGA embedded systems scheduling job-shop makespan criterion uncertain processing times n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science 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. 2021-05-01T15:43:36Z 2021-05-01T15:43:36Z 2020 book ONIX_20210501_9783039432226_946 9783039432226 9783039432233 https://directory.doabooks.org/handle/20.500.12854/69200 eng application/octet-stream Attribution 4.0 International https://mdpi.com/books/pdfview/book/2972 https://mdpi.com/books/pdfview/book/2972 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-03943-223-3 10.3390/books978-3-03943-223-3 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783039432226 9783039432233 354 Basel, Switzerland open access |
| spellingShingle | forgotten index balaban index reclassified the zagreb indices ABC4 index GA5 index HDN3(m) THDN3(m) RHDN3(m) degree of vertex extended adjacency index scheduling with rejection machine non-availability operator non-availability dynamic programming FPTAS Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm bi-criteria scheduling online algorithm makespan maximum machine cost competitive ratio network optimization dynamic flow evacuation planning contraflow configuration partial lane reversals, algorithms and complexity logistic supports scheduling algorithm release-time due-date divisible numbers lateness bin packing time complexity batch scheduling linear deterioration job families Max-cut problem combinatorial optimization deep learning pointer network supervised learning reinforcement learning capacitated lot sizing mixed integer formulation retail inventory shortages graph join product crossing number cyclic permutation arithmetic mean combinatorial generation method algorithm AND/OR tree Euler–Catalan’s triangle labeled Dyck path ranking algorithm unranking algorithm Harris hawks optimizer load frequency control sensitivity analysis smart grid particle swarm optimization genetic algorithm meta-heuristics packing irregular 3D objects quasi-phi-function s nonlinear optimization single-machine scheduling minimization of maximum penalty dual problem inverse problem branch and bound LNS numerical conversion RISC FPGA embedded systems scheduling job-shop makespan criterion uncertain processing times n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science Advances and Novel Approaches in Discrete Optimization |
| title | Advances and Novel Approaches in Discrete Optimization |
| title_full | Advances and Novel Approaches in Discrete Optimization |
| title_fullStr | Advances and Novel Approaches in Discrete Optimization |
| title_full_unstemmed | Advances and Novel Approaches in Discrete Optimization |
| title_short | Advances and Novel Approaches in Discrete Optimization |
| title_sort | advances and novel approaches in discrete optimization |
| topic | forgotten index balaban index reclassified the zagreb indices ABC4 index GA5 index HDN3(m) THDN3(m) RHDN3(m) degree of vertex extended adjacency index scheduling with rejection machine non-availability operator non-availability dynamic programming FPTAS Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm bi-criteria scheduling online algorithm makespan maximum machine cost competitive ratio network optimization dynamic flow evacuation planning contraflow configuration partial lane reversals, algorithms and complexity logistic supports scheduling algorithm release-time due-date divisible numbers lateness bin packing time complexity batch scheduling linear deterioration job families Max-cut problem combinatorial optimization deep learning pointer network supervised learning reinforcement learning capacitated lot sizing mixed integer formulation retail inventory shortages graph join product crossing number cyclic permutation arithmetic mean combinatorial generation method algorithm AND/OR tree Euler–Catalan’s triangle labeled Dyck path ranking algorithm unranking algorithm Harris hawks optimizer load frequency control sensitivity analysis smart grid particle swarm optimization genetic algorithm meta-heuristics packing irregular 3D objects quasi-phi-function s nonlinear optimization single-machine scheduling minimization of maximum penalty dual problem inverse problem branch and bound LNS numerical conversion RISC FPGA embedded systems scheduling job-shop makespan criterion uncertain processing times n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science |
| topic_facet | forgotten index balaban index reclassified the zagreb indices ABC4 index GA5 index HDN3(m) THDN3(m) RHDN3(m) degree of vertex extended adjacency index scheduling with rejection machine non-availability operator non-availability dynamic programming FPTAS Transportation batching scheduling total weighted completion time unary NP-hard approximation algorithm bi-criteria scheduling online algorithm makespan maximum machine cost competitive ratio network optimization dynamic flow evacuation planning contraflow configuration partial lane reversals, algorithms and complexity logistic supports scheduling algorithm release-time due-date divisible numbers lateness bin packing time complexity batch scheduling linear deterioration job families Max-cut problem combinatorial optimization deep learning pointer network supervised learning reinforcement learning capacitated lot sizing mixed integer formulation retail inventory shortages graph join product crossing number cyclic permutation arithmetic mean combinatorial generation method algorithm AND/OR tree Euler–Catalan’s triangle labeled Dyck path ranking algorithm unranking algorithm Harris hawks optimizer load frequency control sensitivity analysis smart grid particle swarm optimization genetic algorithm meta-heuristics packing irregular 3D objects quasi-phi-function s nonlinear optimization single-machine scheduling minimization of maximum penalty dual problem inverse problem branch and bound LNS numerical conversion RISC FPGA embedded systems scheduling job-shop makespan criterion uncertain processing times n/a thema EDItEUR::G Reference, Information and Interdisciplinary subjects::GP Research and information: general thema EDItEUR::P Mathematics and Science |
| url | ONIX_20210501_9783039432226_946 |