Dual Inequalities for Stabilized Column Generation Revisited
From MaRDI portal
Publication:2806874
DOI10.1287/ijoc.2015.0670zbMath1338.90267OpenAlexW565764270MaRDI QIDQ2806874
Publication date: 19 May 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2015.0670
Related Items (16)
Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities ⋮ Technical Note—Product-Based Approximate Linear Programs for Network Revenue Management ⋮ Exactly solving packing problems with fragmentation ⋮ Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows ⋮ 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 ⋮ Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ An empirical analysis of exact algorithms for the unbounded knapsack problem ⋮ BPPLIB: a library for bin packing and cutting stock problems ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes ⋮ Vector Space Decomposition for Solving Large-Scale Linear Programs ⋮ On the benchmark instances for the bin packing problem with conflicts ⋮ Improved flow-based formulations for the skiving stock problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- An exact approach for the vertex coloring problem
- Chebyshev center based column generation
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- A solution procedure for general knapsack problems with a few constraints
- An exact algorithm for the maximum clique problem
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Stabilized column generation
- Solving binary cutting stock problems by column generation and branch- and-bound
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- The multidimensional 0-1 knapsack problem: an overview.
- A fast algorithm for the maximum clique problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- On clique relaxation models in network analysis
- Row-reduced column generation for degenerate master problems
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
- Interior point stabilization for column generation
- A branch-and-cut algorithm for graph coloring
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
- Using Extra Dual Cuts to Accelerate Column Generation
- Algorithms for the Bin Packing Problem with Conflicts
- The Knapsack Problem with Conflict Graphs
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- Dual-Optimal Inequalities for Stabilized Column Generation
- Set Partitioning: A survey
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
- A Column Generation Approach for Graph Coloring
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Integer Programming: Methods, Uses, Computations
- Shortest Path Problems with Resource Constraints
- Cutting Stock Problems
- Implementing Mixed Integer Column Generation
- The Set-Partitioning Problem: Set Covering with Equality Constraints
- Lower bounds and algorithms for the 2-dimensional vector packing problem
This page was built for publication: Dual Inequalities for Stabilized Column Generation Revisited
