An augmented Lagrangian approach to multi-commodity flow problems with conversions

MaRDI QIDQ1077322zbMATH OpenFDO

Authors Peter Värbrand, Kurt Jörnsten

Publication date 1986

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

network flowmulti-commodity flowconversionsaugmented Lagrangian technique

Mathematics Subject Classification ID

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

Recommendations

• On methods for the convex multi-commodity flow problem
• A multicommodity network flow problem with commodity conversion and dependent flows
• scientific article; zbMATH DE number 7071840
• scientific article; zbMATH DE number 1263177
• scientific article; zbMATH DE number 5592286
• A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
• Solving Multicommodity Flow Problems by an Approximation Scheme
• Methods of the convex cone theory in the feasibility problem of multicommodity flow
• Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities
• An augmented Lagrangian algorithm for large scale multicommodity routing

This page was built for publication: An augmented Lagrangian approach to multi-commodity flow problems with conversions

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