Heuristics and lower bounds for the bin packing problem with conflicts
From MaRDI portal
Publication:1765544
DOI10.1016/S0305-0548(02)00195-8zbMath1107.90033MaRDI QIDQ1765544
Michel Gendreau, Gilbert Laporte, Frédéric Semet
Publication date: 23 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Heuristics and matheuristics for a real‐life machine reassignment problem, Vehicle scheduling under the warehouse-on-wheels policy, The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach, Procedures for the bin packing problem with precedence constraints, Lower and upper bounds for the bin packing problem with fragile objects, New lower bounds for bin packing problems with conflicts, Adaptive demand peak management in online transport process planning, The vertex coloring problem and its generalizations, The min-conflict packing problem, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Algorithms for the two dimensional bin packing problem with partial conflicts, A survey on vertex coloring problems, Heuristics for determining the number of warehouses for storing non-compatible products
Cites Work
- Approximation algorithms for time constrained scheduling
- Bounded vertex colorings of graphs
- Lower bounds and reduction procedures for the bin packing problem
- Approximation algorithms for combinatorial problems
- Mutual exclusion scheduling
- A typology of cutting and packing problems
- An approximation scheme for bin packing with conflicts
- New methods to color the vertices of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
