Using Extra Dual Cuts to Accelerate Column Generation
From MaRDI portal
Publication:2890465
DOI10.1287/ijoc.1030.0060zbMath1239.90089OpenAlexW2127777220MaRDI QIDQ2890465
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0060
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities, Exactly solving a two-level location problem with modular node capacities, A generalization of column generation to accelerate convergence, A Branch-and-Price Algorithm for the Multiple Knapsack Problem, Integer linear programming models for the skiving stock problem, Bin packing and cutting stock problems: mathematical models and exact algorithms, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, Models and algorithms for three-stage two-dimensional bin packing, Accelerating column generation for variable sized bin-packing problems, Mathematical programming algorithms for bin packing problems with item fragmentation, Exactly solving packing problems with fragmentation, Exact algorithms for the bin packing problem with fragile objects, Integrated Charge Batching and Casting Width Selection at Baosteel, Stabilizing branch‐and‐price for constrained tree problems, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Mathematical models and approximate solution approaches for the stochastic bin packing problem, A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint, A note on branch-and-cut-and-price, Lower and upper bounds for the bin packing problem with fragile objects, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, An exact approach for the vertex coloring problem, Column generation for extended formulations, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Lower bounds and algorithms for the minimum cardinality bin covering problem, A generic view of Dantzig--Wolfe decomposition in mixed integer programming, Characterizing the optimality gap and the optimal packings for the bin packing problem, Exact solution techniques for two-dimensional cutting and packing, Stabilized branch-and-price algorithms for vector packing problems, Solving bin packing problems using VRPSolver models, Dual Inequalities for Stabilized Column Generation Revisited, A lexicographic pricer for the fractional bin packing problem, Vector Space Decomposition for Solving Large-Scale Linear Programs, A branch-and-price algorithm for the temporal bin packing problem
Uses Software
