Advanced start for the multicommodity network flow problem

DOI10.1007/BFB0121100MaRDI QIDQ3714875zbMATH OpenOpenAlexFDO

Authors G. Savioi

Publication date 1986

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0121100

zbMATH Keywords

Advanced starting basesheuristicLagrangean relaxationminimal cost multicommodity network flowpartitioningrelaxationsimplex methodssubgradient techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Recommendations

• Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
• Dual-ascent methods for large-scale multicommodity flow problems
• New methods for multi-commodity flows
• A surrogate and Lagrangian approach to constrained network problems
• An implementation of linear and nonlinear multicommodity network flows

Cited in

(6)

• Conditional subgradient optimization -- theory and applications
• Heuristic methods and applications: A categorized survey
• An extended model and a column generation algorithm for the planar multicommodity flow problem
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• Dual-ascent methods for large-scale multicommodity flow problems
• Basis characterisation for linear multicommodity network programs

This page was built for publication: Advanced start for the multicommodity network flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714875)