A Constraint for Bin Packing-Reference-Cited by-同舟云学术

A Constraint for Bin Packing

Published:2004 Issue: Volume: Page:648-662
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2004
language:
Short-container-title:

Author:

Shaw Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30201-8_47.pdf

Reference17 articles.

1. Valerio de Carvalho, J.: Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86, 629–659 (1999)

2. Coffman Jr., E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: A survery. In: Hochbaum, D. (ed.) Appoximation algorithms for NP-Hard Problems, pp. 46–93. PWS Publishing, Boston (1996)

3. Falkenauer, E.: A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics 2, 5–30 (1996)

4. Friesen, D.K., Langston, M.A.: Variable sized bin packing. SIAM Journal on Computing 15, 222–230 (1986)

5. Gent, I., Walsh, T.: From approximate to optimal solutions: Constructing pruning and propagation rules. In: Proceedings of the 15th IJCAI (1997)

Cited by 46 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multi-Criteria Optimization of Application Offloading in the Edge-to-Cloud Continuum;2023 62nd IEEE Conference on Decision and Control (CDC);2023-12-13

2. Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem;INFORMS Journal on Computing;2023-03

3. Packing-based branch-and-bound for discrete malleable task scheduling;Journal of Scheduling;2022-09-22

4. Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022

5. The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints;INFORMS Journal on Computing;2021-07