A stabilized structured Dantzig-Wolfe decomposition method
From MaRDI portal
Publication:359629
DOI10.1007/S10107-012-0626-8zbMATH Open1272.90029OpenAlexW1964852627WikidataQ118165462 ScholiaQ118165462MaRDI QIDQ359629FDOQ359629
Authors: Antonio Frangioni, Bernard Gendron 
Publication date: 12 August 2013
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-0626-8
Recommendations
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems
- scientific article; zbMATH DE number 3961340
- Using central prices in the decomposition of linear programs
- scientific article; zbMATH DE number 1062478
stabilizationreformulationDantzig-Wolfe decomposition methodmulticommodity capacitated network design problemstructured linear program
Cites Work
- Generalized Bundle Methods
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- A suggested computation for maximal multi-commodity network flows
- Title not available (Why is that?)
- An extended model and a column generation algorithm for the planar multicommodity flow problem
- The convex hull of two core capacitated network design problems
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Decomposition Principle for Linear Programs
- About Lagrangian methods in integer optimization
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Cutting Stock Problems
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Dual-Optimal Inequalities for Stabilized Column Generation
- On the choice of explicit stabilizing terms in column generation
- 0-1 reformulations of the multicommodity capacitated network design problem
- New approaches for optimizing over the semimetric polytope
- On compact formulations for integer programs solved by column generation
- An inexact bundle variant suited to column generation
- Multicommodity network flows: The impact of formulation on decomposition
- The volume algorithm revisited: relation with bundle methods
- Bi-dynamic constraint aggregation and subproblem reduction
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Convergence analysis of deflected conditional approximate subgradient methods
Cited In (24)
- Large-scale optimization with the primal-dual column generation method
- Revisiting Lagrangian relaxation for network design
- Quasi-separable Dantzig-Wolfe reformulations for network design
- Divide to conquer: decomposition methods for energy optimization
- Convexity and optimization with copulæ structured probabilistic constraints
- A lexicographic pricer for the fractional bin packing problem
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Exact approaches for designing multifacility buy-at-bulk networks
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- 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
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A note on ``A LP-based heuristic for a time-constrained routing problem
- A multiperiod drayage problem with customer-dependent service periods
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations
- Dantzig-Wolfe decomposition for solving multistage stochastic capacity-planning problems
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Exact approaches to the single-source network loading problem
This page was built for publication: A stabilized structured Dantzig-Wolfe decomposition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359629)
