Multicommodity network flows: The impact of formulation on decomposition
From MaRDI portal
Publication:1321667
DOI10.1007/BF01585162zbMath0802.90039WikidataQ60140245 ScholiaQ60140245MaRDI QIDQ1321667
Judith M. Farvolden, Warren B. Powell, Kim L. Jones, Irvin J. Lustig
Publication date: 28 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
A generalization of column generation to accelerate convergence, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method, Dynamic fleet management as a logistics queueing network, Composite-variable modeling for service parts logistics, A stabilized structured Dantzig-Wolfe decomposition method, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Incremental Bundle Methods using Upper Models, A class of Dantzig-Wolfe type decomposition methods for variational inequality problems, Unnamed Item, Column generation for extended formulations, Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design, Scheduling training for a tank battalion: how to measure readiness, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, An implementation of a parallel primal-dual interior point method for block- structured linear programs, Network design and flow problems with cross-arc costs, Multi-service multi-facility network design under uncertainty, Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE, Simultaneous fleet assignment and cargo routing using Benders decomposition, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, A novel modeling approach for express package carrier planning, A feasibility evaluation approach for time-evolving multi-item production–distribution networks, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, Dynamic control of multicommodity fleet management problems, Using an interior point method for the master problem in a decomposition approach, A decomposition-based approach for the multiperiod multiproduct distribution planning problem, About Lagrangian methods in integer optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Decomposition Algorithm for Linear Programs
- A Review of Sensitivity Results for Linear Networks and a New Approximation to Reduce the Effects of Degeneracy
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- An Interior Point Method for Block Angular Optimization
- The Influence of Computer Language on Computational Comparisons: An Example from Network Optimization
- Parallel Decomposition of Multicommodity Network Flows Using a Linear-Quadratic Penalty Algorithm
- Multicommodity network flows—A survey
- A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem
