The min-conflict packing problem
From MaRDI portal
Publication:1761135
DOI10.1016/j.cor.2011.10.021zbMath1251.90326MaRDI QIDQ1761135
François Clautiaux, El-Ghazali Talbi, Saïd Hanafi, Ali Khanafer
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.021
multi-objective optimization; column generation; tabu search; knapsack problem; bin packing with conflicts
Related Items
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for time constrained scheduling
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- New lower bounds for bin packing problems with conflicts
- New lower bounds based on column generation and constraint programming for the pattern minimization problem
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
- Heuristics and lower bounds for the bin packing problem with conflicts
- An improved typology of cutting and packing problems
- Accelerating column generation for variable sized bin-packing problems
- Mathematical Methods of Organizing and Planning Production
- Algorithms for the Bin Packing Problem with Conflicts
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
