A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
From MaRDI portal
Publication:2899132
DOI10.1287/ijoc.1100.0406zbMath1243.90089OpenAlexW2124475618MaRDI QIDQ2899132
Lingzi Li, Mariem Gzara, Samir Elhedhli, 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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A Lagrangian decomposition approach for the pump scheduling problem in water networks, Homogeneous grouping of non-prime steel products for online auctions: a case study, An exact algorithm for parallel machine scheduling with conflicts, A matheuristic for a customer assignment problem in direct marketing, Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation, Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows, A Wide Branching Strategy for the Graph Coloring Problem, Minimum cost flow problem with conflicts, Bin Packing Problem with Time Lags, A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph, A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches, Solving vertex coloring problems as maximum weight stable set problems, 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, A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems, On the benchmark instances for the bin packing problem with conflicts, A branch-and-price algorithm for the two-dimensional vector packing problem, Robust drone selective routing in humanitarian transportation network assessment
