The min-conflict packing problem

DOI10.1016/j.cor.2011.10.021zbMath1251.90326OpenAlexW2083120958MaRDI 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

zbMATH Keywords

multi-objective optimizationcolumn generationtabu searchknapsack problembin packing with conflicts

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (6)

ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem ⋮ Bin packing problem with conflicts and item fragmentation ⋮ On the benchmark instances for the bin packing problem with conflicts

Uses Software

• ParaDisEO
• Tabu search

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

This page was built for publication: The min-conflict packing problem