Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
From MaRDI portal
Publication:2434985
DOI10.1007/s10107-012-0561-8zbMath1282.90098OpenAlexW2028100337MaRDI QIDQ2434985
Ş. İlker Birbil, Kerem Bülbül, Ịbrahim Muter
Publication date: 3 February 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0561-8
linear programmingcolumn generationcolumn-and-row generationcolumn-dependent-rowsrow-and-column generationquadratic set coveringmulti-stage cutting stockpricing subproblem
Related Items
Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints, Solution methods for the tray optimization problem, A note on ``A LP-based heuristic for a time-constrained routing problem, Exact algorithms to minimize makespan on single and parallel batch processing machines, Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation, Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, An ILP-based local search procedure for the VRP with pickups and deliveries, Column generation for extended formulations, An exact column-generation approach for the lot-type design problem, A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways, A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach, Weighted network search games with multiple hidden objects and multiple search teams, Algorithms for the one-dimensional two-stage cutting stock problem, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition, One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model, The time buffer approximated buffer allocation problem: a row-column generation approach, Multilevel Approaches for the Critical Node Problem
Cites Work
- A stabilized structured Dantzig-Wolfe decomposition method
- A note on branch-and-cut-and-price
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- Computational study of large-scale \(p\)-median problems
- 0-1 reformulations of the multicommodity capacitated network design problem
- Crew pairing at Air France
- Plant location with minimum inventory
- Row and column generation technique for a multistage cutting stock problem
- A two-phase roll cutting problem
- Modeling multistage cutting stock problems
- A note on ``A LP-based heuristic for a time-constrained routing problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A LP-based heuristic for a time-constrained routing problem
- Parallel Machine Scheduling by Column Generation
- Column Generation for Extended Formulations
- Cutting planes for branch-and-price algorithms
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A Linearization technique for solving the quadratic set covering problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Column Generation
- Selected Topics in Column Generation
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
