Heuristics and lower bounds for the bin packing problem with conflicts

DOI10.1016/S0305-0548(02)00195-8zbMath1107.90033MaRDI QIDQ1765544

Frédéric Semet, Michel Gendreau, Gilbert Laporte

Publication date: 23 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

Determining the Minimum Number of Warehouses and their Space-Size for Storing Compatible Items, A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph, Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem, Unnamed Item, Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows, Bin Packing Problem with Time Lags, Heuristics and matheuristics for a real‐life machine reassignment problem, A Multi-start Tabu Search Based Algorithm for Solving the Warehousing Problem with Conflict, On conflict-free spanning tree: algorithms and complexity, The knapsack problem with forfeit sets, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, 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, Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal, A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts, The min-conflict packing problem, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, Bin packing problem with conflicts and item fragmentation, The vehicle routing problem with heterogeneous locker boxes, On the benchmark instances for the bin packing problem with conflicts, Homogeneous grouping of non-prime steel products for online auctions: a case study, Parameterized complexity of conflict-free matchings and paths, Pickup and delivery problem with incompatibility constraints, A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Algorithms for the two dimensional bin packing problem with partial conflicts, A survey on vertex coloring problems, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, Heuristics for determining the number of warehouses for storing non-compatible products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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