The min-conflict packing problem

DOI10.1016/J.COR.2011.10.021MaRDI QIDQ1761135zbMATH OpenOpenAlexFDO

Authors Ali Khanafer, François Clautiaux, Saïd Hanafi, El-Ghazali Talbi

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

knapsack problemmulti-objective optimizationcolumn generationtabu searchbin packing with conflicts

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for the bin packing problem with conflicts
• Heuristics for solving the bin-packing problem with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• New lower bounds for bin packing problems with conflicts
• A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation

Cites work

• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 1302201 (Why is no real title available?)
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
• Accelerating column generation for variable sized bin-packing problems
• Algorithms for the bin packing problem with conflicts
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• An improved typology of cutting and packing problems
• Approximation algorithms for time constrained scheduling
• Decomposition Principle for Linear Programs
• Heuristics and lower bounds for the bin packing problem with conflicts
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• New lower bounds based on column generation and constraint programming for the pattern minimization problem
• New lower bounds for bin packing problems with conflicts
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts

Cited in

(10)

• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• Heuristics for solving the bin-packing problem with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts
• Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer
• The minimum backlog problem
• On the benchmark instances for the bin packing problem with conflicts
• 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
• A multi-start tabu search based algorithm for solving the warehousing problem with conflict

Describes a project that uses

Uses Software

• Tabu search
• ParaDisEO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761135)