A stabilized structured Dantzig-Wolfe decomposition method
From MaRDI portal
Publication:359629
DOI10.1007/s10107-012-0626-8zbMath1272.90029OpenAlexW1964852627WikidataQ118165462 ScholiaQ118165462MaRDI QIDQ359629
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
stabilizationreformulationDantzig-Wolfe decomposition methodmulticommodity capacitated network design problemstructured linear program
Related Items
Large-scale optimization with the primal-dual column generation method, Exact approaches to the single-source network loading problem, Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, A multiperiod drayage problem with customer-dependent service periods, A note on ``A LP-based heuristic for a time-constrained routing problem, Revisiting Lagrangian relaxation for network design, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, 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, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Column generation for extended formulations, Exact Approaches for Designing Multifacility Buy-at-Bulk Networks, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Divide to conquer: decomposition methods for energy optimization, 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, A lexicographic pricer for the fractional bin packing problem, Convexity and optimization with copulæ structured probabilistic constraints, Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
Cites Work
- Unnamed Item
- The convex hull of two core capacitated network design problems
- About Lagrangian methods in integer optimization
- On compact formulations for integer programs solved by column generation
- An inexact bundle variant suited to column generation
- On the choice of explicit stabilizing terms in column generation
- 0-1 reformulations of the multicommodity capacitated network design problem
- Multicommodity network flows: The impact of formulation on decomposition
- The volume algorithm revisited: relation with bundle methods
- On splittable and unsplittable flow capacitated network design arc-set polyhedra.
- Bi-dynamic constraint aggregation and subproblem reduction
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- New approaches for optimizing over the semimetric polytope
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Decomposition Principle for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- An extended model and a column generation algorithm for the planar multicommodity flow problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Generalized Bundle Methods
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Cutting Stock Problems
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
