scientific article
From MaRDI portal
Publication:3768657
zbMath0631.90025MaRDI QIDQ3768657
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyshortest pathapproximationmulticommodity flowdynamic networknetwork synthesisgreedy-type algorithmoptimum network designtwo stage decompositionlarge sequential graphMinimum Cost Dynamic Multicommodity FlowPresent Worth of Actual Cost Criterion
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (8)
A Lagrangean heuristic for the capacitated concave minimum cost network flow problem ⋮ Long range planning in the process industries: A projection approach ⋮ Some thoughts on combinatorial optimisation ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Finding minimum cost directed trees with demands and capacities ⋮ Configuring wide area computer networks. Problems and models ⋮ Tele-network design based on queue competition algorithm ⋮ Models for planning capacity expansion in local access telecommunication networks
This page was built for publication:
