scientific article
From MaRDI portal
Publication:3840281
zbMath0905.90064MaRDI QIDQ3840281
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
branch-and-boundsubgradient optimizationcapacitated network designLagrangean heuristicmulticommodity minimal cost network flow
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Planning models for long-haul operations of postal and express shipment companies