scientific article; zbMATH DE number 4027150
zbMATH Open0631.90025MaRDI QIDQ3768657FDOQ3768657
Authors: Michel Minoux 
Publication date: 1987
Title of this publication is not available (Why is that?)
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
surveyapproximationshortest pathdynamic networkmulticommodity flownetwork 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)
Cited In (26)
- Synthesis of optimal networks
- Some thoughts on combinatorial optimisation
- A class of problems of optimal net synthesis
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Title not available (Why is that?)
- Models for planning capacity expansion in local access telecommunication networks
- Title not available (Why is that?)
- Synthesis of structure of regional computer networks under additional conditions
- Network Optimization and Control
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Finding minimum cost directed trees with demands and capacities
- Global optimum search in the network design problem
- Title not available (Why is that?)
- Time-varying network optimization.
- Configuring wide area computer networks. Problems and models
- Minimum‐cost flow problems having arc‐activation costs
- Tele-network design based on queue competition algorithm
- Network Synthesis for Distributed Embedded Systems
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem
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)
