The min-conflict packing problem
type: Item
instance of: scholarly article
title: The min-conflict packing problem
zbMATH Open document ID: 1251.90326
author: Ali Khanafer
author: François Clautiaux
author: Saïd Hanafi
author: El-Ghazali Talbi
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6106571
zbMATH Keywords: bin packing with conflicts
zbMATH Keywords: knapsack problem
zbMATH Keywords: column generation
zbMATH Keywords: multi-objective optimization
zbMATH Keywords: tabu search
describes a project that uses: ParaDisEO
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.cor.2011.10.021
OpenAlex ID: W2083120958
cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
cites work: Accelerating column generation for variable sized bin-packing problems
cites work: New lower bounds based on column generation and constraint programming for the pattern minimization problem
cites work: Q3347319
cites work: Decomposition Principle for Linear Programs
cites work: Algorithms for the bin packing problem with conflicts
cites work: Heuristics and lower bounds for the bin packing problem with conflicts
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Q4247468
cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
cites work: On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: Approximation algorithms for time constrained scheduling
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
cites work: New lower bounds for bin packing problems with conflicts
cites work: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
cites work: An improved typology of cutting and packing problems
DOI: 10.1016/J.COR.2011.10.021
description: scientific article; zbMATH DE number 6106571