Bin packing and related problems: General arc-flow formulation with graph compression
- 1 May 2016
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 69, 56-67
Abstract
No abstract availableKeywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Bin Packing with Conflicts: A Generic Branch-and-Price AlgorithmINFORMS Journal on Computing, 2013
- Algorithms for the Bin Packing Problem with ConflictsINFORMS Journal on Computing, 2010
- Improved Results for a Memory Allocation ProblemTheory of Computing Systems, 2009
- Lower bounds and algorithms for the 2-dimensional vector packing problemDiscrete Applied Mathematics, 2001
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing ProblemsINFORMS Journal on Computing, 1999
- A hybrid grouping genetic algorithm for bin packingJournal of Heuristics, 1996
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problemEuropean Journal of Operational Research, 1995
- Integer Rounding for Polymatroid and Branching Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1981
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961