scientific article; zbMATH DE number 4027150

MaRDI QIDQ3768657zbMATH OpenFDO

Authors Michel Minoux

Publication date 1987

zbMATH Keywords

surveyapproximationshortest pathdynamic networkmulticommodity flownetwork synthesisgreedy-type algorithmoptimum network designtwo stage decompositionlarge sequential graphMinimum Cost Dynamic Multicommodity FlowPresent Worth of Actual Cost Criterion

Mathematics Subject Classification ID

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)

Recommendations

• Networks synthesis and optimum network design problems: Models, solution methods and applications
• The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
• Synthesis of a Communication Network
• scientific article; zbMATH DE number 4045458
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements

Cited in

(26)

• Some thoughts on combinatorial optimisation
• Synthesis of optimal networks
• A class of problems of optimal net synthesis
• Networks synthesis and optimum network design problems: Models, solution methods and applications
• scientific article; zbMATH DE number 4045458 (Why is no real title available?)
• Models for planning capacity expansion in local access telecommunication networks
• scientific article; zbMATH DE number 1757958 (Why is no real title available?)
• Synthesis of structure of regional computer networks under additional conditions
• Network Optimization and Control
• scientific article; zbMATH DE number 3882168 (Why is no real title available?)
• scientific article; zbMATH DE number 3257811 (Why is no real title available?)
• Optimized Design of Dynamic Networks with Heuristic Algorithms
• Design of one class of transportation networks by dynamic programming
• Synthesis of a Communication Network
• Long range planning in the process industries: A projection approach
• Synthesis of 2-Commodity Flow Networks
• scientific article; zbMATH DE number 841993 (Why is no real title available?)
• Finding minimum cost directed trees with demands and capacities
• Global optimum search in the network design problem
• Time-varying network optimization.
• scientific article; zbMATH DE number 3876469 (Why is no real title available?)
• Configuring wide area computer networks. Problems and models
• Minimum‐cost flow problems having arc‐activation costs
• Tele-network design based on queue competition algorithm
• A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
• Network Synthesis for Distributed Embedded Systems

This page was built for publication:

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