A branch-and-price algorithm for the bin packing problem with conflicts

DOI10.1287/IJOC.1100.0406MaRDI QIDQ2899132zbMATH OpenOpenAlexFDO

Authors Samir Elhedhli, Lingzi Li, Mariem Gzara, Joe Naoum-Sawaya

Publication date 28 July 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1100.0406

zbMATH Keywords

bin packing problem with conflictsbranch and priceLagrangean relaxationmaximal clique inequalities

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Algorithms for the bin packing problem with conflicts
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• A branch-and-price algorithm for the two-dimensional vector packing problem
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• Heuristics and lower bounds for the bin packing problem with conflicts

Cited in

(30)

• A comparison of optimization methods for multi-objective constrained bin packing problems
• A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• Exact solution algorithms for the maximum flow problem with additional conflict constraints
• Bin packing problem with conflicts and item fragmentation
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
• On the benchmark instances for the bin packing problem with conflicts
• Robust drone selective routing in humanitarian transportation network assessment
• Homogeneous grouping of non-prime steel products for online auctions: a case study
• A matheuristic for a customer assignment problem in direct marketing
• A branch-and-price algorithm for the two-dimensional vector packing problem
• An exact algorithm for parallel machine scheduling with conflicts
• A Lagrangian decomposition approach for the pump scheduling problem in water networks
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Algorithms for the bin packing problem with conflicts
• A Wide Branching Strategy for the Graph Coloring Problem
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Branch and Price for Chance-Constrained Bin Packing
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
• 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
• The vehicle routing problem with floating targets: formulation and solution approaches
• Solving vertex coloring problems as maximum weight stable set problems
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• Minimum cost flow problem with conflicts
• A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
• Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
• Improved approximation algorithms for bin packing with conflicts
• An exact approach for bi-objective non-identical batch processing machines scheduling

This page was built for publication: A branch-and-price algorithm for the bin packing problem with conflicts

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