Column generation for extended formulations
From MaRDI portal
Publication:458128
DOI10.1007/S13675-013-0009-9zbMATH Open1305.90312OpenAlexW3023456609MaRDI QIDQ458128FDOQ458128
Publication date: 30 September 2014
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-013-0009-9
Cites Work
- Title not available (Why is that?)
- Partitioning procedures for solving mixed-variables programming problems
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Production Planning by Mixed Integer Programming
- A stabilized structured Dantzig-Wolfe decomposition method
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
- A note on branch-and-cut-and-price
- A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
- A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem
- Parallel machine scheduling by column generation
- Using extra dual cuts to accelerate column generation
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- 0-1 reformulations of the multicommodity capacitated network design problem
- Vehicle scheduling in public transit and Lagrangean pricing
- Time-indexed formulations and the total weighted tardiness problem
- Multicommodity network flows: The impact of formulation on decomposition
- Approximate extended formulations
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
- Polyhedral Characterization of Discrete Dynamic Programming
- Branched Polyhedral Systems
Cited In (10)
- 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
- A simple perspective on simultaneous column and row generation
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- Network-Based Approximate Linear Programming for Discrete Optimization
- Exact solution of network flow models with strong relaxations
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes
- The multi-trip container drayage problem with synchronization for efficient empty containers re-usage
Uses Software
This page was built for publication: Column generation for extended formulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458128)
