Dual-ascent methods for large-scale multicommodity flow problems

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4" /><305::AID-NAV3220400303>3.0.CO;2-4 10.1002/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4zbMath0780.90030OpenAlexW2107103079MaRDI QIDQ4697327

Cynthia Barnhart

Publication date: 29 June 1993

Full work available at URL: https://doi.org/10.1002/1520-6750(199304)40:3<305::aid-nav3220400303>3.0.co;2-4

zbMATH Keywords

near- optimal solutionsdual-ascent heuristicscapacitated multicommodity network flow

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Matheuristics: survey and synthesis ⋮ Discrete facility location and routing of obnoxious activities. ⋮ Unnamed Item ⋮ Analysis of budget for interdiction on multicommodity network flows ⋮ Dual-based approach for a hub network design problem under non-restrictive policy ⋮ About Lagrangian methods in integer optimization

Cites Work

• Unnamed Item
• Advanced start for the multicommodity network flow problem
• Nielsen Equivalence and Simple-Homotopy Type
• Optimum branchings

This page was built for publication: Dual-ascent methods for large-scale multicommodity flow problems