Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
From MaRDI portal
Publication:2434985
DOI10.1007/S10107-012-0561-8zbMATH Open1282.90098OpenAlexW2028100337MaRDI QIDQ2434985FDOQ2434985
Authors: Ş. İ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
Recommendations
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- Generalized column generation for linear programming
- A Primer in Column Generation
- Column generation for extended formulations
- Branch-and-price: Column generation for solving huge integer programs
linear programmingcolumn generationcolumn-and-row generationcolumn-dependent-rowsrow-and-column generationquadratic set coveringmulti-stage cutting stockpricing subproblem
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- Crew pairing at Air France
- Selected Topics in Column Generation
- A stabilized structured Dantzig-Wolfe decomposition method
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- A Linearization technique for solving the quadratic set covering problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- Decomposition Principle for Linear Programs
- Column Generation
- Computational study of large-scale \(p\)-median problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A note on branch-and-cut-and-price
- Cutting planes for branch-and-price algorithms
- Parallel machine scheduling by column generation
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- 0-1 reformulations of the multicommodity capacitated network design problem
- Plant location with minimum inventory
- Modeling multistage cutting stock problems
- Row and column generation technique for a multistage cutting stock problem
- A two-phase roll cutting problem
- A note on ``A LP-based heuristic for a time-constrained routing problem
- A LP-based heuristic for a time-constrained routing problem
- Column generation for extended formulations
Cited In (21)
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- A Column-and-Row Generation Algorithm for a Crew Planning Problem in Railways
- Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
- Algorithms for the one-dimensional two-stage cutting stock problem
- 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
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Solution methods for the tray optimization problem
- The time buffer approximated buffer allocation problem: a row-column generation approach
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- Column generation for extended formulations
- Multilevel approaches for the critical node problem
- A simple perspective on simultaneous column and row generation
- A note on ``A LP-based heuristic for a time-constrained routing problem
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition
- Exact algorithms to minimize makespan on single and parallel batch processing machines
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- An ILP-based local search procedure for the VRP with pickups and deliveries
- Row-reduced column generation for degenerate master problems
- An exact column-generation approach for the lot-type design problem
This page was built for publication: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434985)
