Mathematical Methods for Operations Research Problems
This reprint of the Special Issue in the journal Mathematics presents research in the area of Operations Research. The subjects addressed in the 15 research papers cover a broad spectrum of subjects, such as machine learning, scheduling, timetabling, or graph theory.
Պահպանված է:
| Ձևաչափ: | Online |
|---|---|
| Լեզու: | անգլերեն |
| Հրապարակվել է: |
MDPI - Multidisciplinary Digital Publishing Institute
2024
|
| Խորագրեր: | |
| Առցանց հասանելիություն: | ONIX_20240906_9783725816262_157 |
| Ցուցիչներ: |
Չկան պիտակներ, Եղեք առաջինը, ով նշում է այս գրառումը!
|
| _version_ | 1869523358603804672 |
|---|---|
| collection | Directory of Open Access Books |
| description | This reprint of the Special Issue in the journal Mathematics presents research in the area of Operations Research. The subjects addressed in the 15 research papers cover a broad spectrum of subjects, such as machine learning, scheduling, timetabling, or graph theory. |
| format | Online |
| id | doab-20.500.12854ir-143795 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2024 |
| publishDateRange | 2024 |
| publishDateSort | 2024 |
| publisher | MDPI - Multidisciplinary Digital Publishing Institute |
| publisherStr | MDPI - Multidisciplinary Digital Publishing Institute |
| record_format | ojs |
| spelling | doab-20.500.12854ir-1437952024-09-06T08:27:18Z Mathematical Methods for Operations Research Problems Werner, Frank integer programming digital geometry non-traditional grids shortest chamfer paths 4D grid linear programming optimization digital distances chamfer distances weighted distances ant colony optimization mathematical programming negative learning minimum dominating set multi-dimensional knapsack problem discrete optimization operational research computational geometry complexity algorithms dynamic programming clustering k-center p-center sum-radii clustering sum-diameter clustering bi-objective optimization Pareto Front parallel programming global total domination total k-domination number Best–Worst Method Eigenvalue Method Geometric Mean Method Monte Carlo simulations pairwise comparisons sensitivity scheduling uniform machines release time delivery time time complexity algorithm pressing process printed circuit board mixed-integer linear programming heuristic swarm intelligence method parameter control adaptive technique hidden Markov model (s, Q)-policy Markovian Arrival Process N-policy impatient customers cryptocurrency portfolio selection return and risk measures market capitalization volume attractiveness PROMETHEE II multicriteria model carbon emission carbon trading e-commerce supply chain sustainable development clustering techniques metaheuristics machine learning self-adaptive parameter setting exploration exploitation hybrid approach optimisation multiphase systems heavy traffic Little’s formula timetabling problem course university timetabling problem AACSB standards integer linear programming n/a thema EDItEUR::P Mathematics and Science thema EDItEUR::P Mathematics and Science::PB Mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBU Optimization This reprint of the Special Issue in the journal Mathematics presents research in the area of Operations Research. The subjects addressed in the 15 research papers cover a broad spectrum of subjects, such as machine learning, scheduling, timetabling, or graph theory. 2024-09-06T08:27:14Z 2024-09-06T08:27:14Z 2024 book ONIX_20240906_9783725816262_157 9783725816262 9783725816255 https://directory.doabooks.org/handle/20.500.12854/143795 eng application/octet-stream Attribution-NonCommercial-NoDerivatives 4.0 International https://mdpi.com/books/pdfview/book/9535 https://mdpi.com/books/pdfview/book/9535 MDPI - Multidisciplinary Digital Publishing Institute 10.3390/books978-3-7258-1625-5 10.3390/books978-3-7258-1625-5 46cabcaa-dd94-4bfe-87b4-55023c1b36d0 9783725816262 9783725816255 open access |
| spellingShingle | integer programming digital geometry non-traditional grids shortest chamfer paths 4D grid linear programming optimization digital distances chamfer distances weighted distances ant colony optimization mathematical programming negative learning minimum dominating set multi-dimensional knapsack problem discrete optimization operational research computational geometry complexity algorithms dynamic programming clustering k-center p-center sum-radii clustering sum-diameter clustering bi-objective optimization Pareto Front parallel programming global total domination total k-domination number Best–Worst Method Eigenvalue Method Geometric Mean Method Monte Carlo simulations pairwise comparisons sensitivity scheduling uniform machines release time delivery time time complexity algorithm pressing process printed circuit board mixed-integer linear programming heuristic swarm intelligence method parameter control adaptive technique hidden Markov model (s, Q)-policy Markovian Arrival Process N-policy impatient customers cryptocurrency portfolio selection return and risk measures market capitalization volume attractiveness PROMETHEE II multicriteria model carbon emission carbon trading e-commerce supply chain sustainable development clustering techniques metaheuristics machine learning self-adaptive parameter setting exploration exploitation hybrid approach optimisation multiphase systems heavy traffic Little’s formula timetabling problem course university timetabling problem AACSB standards integer linear programming n/a thema EDItEUR::P Mathematics and Science thema EDItEUR::P Mathematics and Science::PB Mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBU Optimization Mathematical Methods for Operations Research Problems |
| title | Mathematical Methods for Operations Research Problems |
| title_full | Mathematical Methods for Operations Research Problems |
| title_fullStr | Mathematical Methods for Operations Research Problems |
| title_full_unstemmed | Mathematical Methods for Operations Research Problems |
| title_short | Mathematical Methods for Operations Research Problems |
| title_sort | mathematical methods for operations research problems |
| topic | integer programming digital geometry non-traditional grids shortest chamfer paths 4D grid linear programming optimization digital distances chamfer distances weighted distances ant colony optimization mathematical programming negative learning minimum dominating set multi-dimensional knapsack problem discrete optimization operational research computational geometry complexity algorithms dynamic programming clustering k-center p-center sum-radii clustering sum-diameter clustering bi-objective optimization Pareto Front parallel programming global total domination total k-domination number Best–Worst Method Eigenvalue Method Geometric Mean Method Monte Carlo simulations pairwise comparisons sensitivity scheduling uniform machines release time delivery time time complexity algorithm pressing process printed circuit board mixed-integer linear programming heuristic swarm intelligence method parameter control adaptive technique hidden Markov model (s, Q)-policy Markovian Arrival Process N-policy impatient customers cryptocurrency portfolio selection return and risk measures market capitalization volume attractiveness PROMETHEE II multicriteria model carbon emission carbon trading e-commerce supply chain sustainable development clustering techniques metaheuristics machine learning self-adaptive parameter setting exploration exploitation hybrid approach optimisation multiphase systems heavy traffic Little’s formula timetabling problem course university timetabling problem AACSB standards integer linear programming n/a thema EDItEUR::P Mathematics and Science thema EDItEUR::P Mathematics and Science::PB Mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBU Optimization |
| topic_facet | integer programming digital geometry non-traditional grids shortest chamfer paths 4D grid linear programming optimization digital distances chamfer distances weighted distances ant colony optimization mathematical programming negative learning minimum dominating set multi-dimensional knapsack problem discrete optimization operational research computational geometry complexity algorithms dynamic programming clustering k-center p-center sum-radii clustering sum-diameter clustering bi-objective optimization Pareto Front parallel programming global total domination total k-domination number Best–Worst Method Eigenvalue Method Geometric Mean Method Monte Carlo simulations pairwise comparisons sensitivity scheduling uniform machines release time delivery time time complexity algorithm pressing process printed circuit board mixed-integer linear programming heuristic swarm intelligence method parameter control adaptive technique hidden Markov model (s, Q)-policy Markovian Arrival Process N-policy impatient customers cryptocurrency portfolio selection return and risk measures market capitalization volume attractiveness PROMETHEE II multicriteria model carbon emission carbon trading e-commerce supply chain sustainable development clustering techniques metaheuristics machine learning self-adaptive parameter setting exploration exploitation hybrid approach optimisation multiphase systems heavy traffic Little’s formula timetabling problem course university timetabling problem AACSB standards integer linear programming n/a thema EDItEUR::P Mathematics and Science thema EDItEUR::P Mathematics and Science::PB Mathematics thema EDItEUR::P Mathematics and Science::PB Mathematics::PBU Optimization |
| url | ONIX_20240906_9783725816262_157 |