The circular balancing problem
Year of publication: |
2025
|
---|---|
Authors: | Lee, Myungho ; Lee, Kangbok ; Pinedo, Michael |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 321.2025, 1 (16.2.), p. 41-56
|
Subject: | Approximation algorithm | Circular permutation | Combinatorial optimization | Computational complexity | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Kreislaufwirtschaft | Recycling |
-
The Quadratic Unconstrained Binary Optimization Problem : Theory, Algorithms, and Applications
Punnen, Abraham P., (2022)
-
An alternative approach for proving the NP-hardness of optimization problems
Cheng, T. C. E., (2016)
-
On the complexity of the FIFO stack-up problem
Gurski, Frank, (2016)
- More ...
-
Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs
Lee, Myungho, (2022)
-
Lee, Myungho, (2024)
-
An integrated batching problem for steel plate manufacturing with bi-strand casting
Lee, Myungho, (2023)
- More ...