Approximation algorithms for the 𝜅⁺-star packing problem
Year of publication: |
2025
|
---|---|
Authors: | Huang, Zhihua ; Zhang, An ; Gao, Mingqi ; Sun, Jiayi ; Chen, Yong |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 59.2025, Art.-No. 107249, p. 1-7
|
Subject: | Local search | Approximation ratio | Balanced tree | Star packing | Algorithmus | Algorithm | Packproblem | Packing problem | Theorie | Theory | Operations Research | Operations research | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming |
-
Heuristic methods for the leather nesting problem in the automotive industry
Pinto, Telmo Miguel Pires, (2016)
-
Algorithms for the two dimensional bin packing problem with partial conflicts
Hamdi-Dhaoui, Khaoula, (2012)
-
Kim, Kyungdoc, (2014)
- More ...
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
-
Parallel machines scheduling with machine maintenance for minsum criteria
Tan, Zhiyi, (2011)
-
Parallel machines scheduling with machine maintenance for minsum criteria
Tan, Zhiyi, (2011)
- More ...