Networks synthesis and optimum network design problems: Models, solution methods and applications

DOI10.1002/net.3230190305zbMath0666.90032OpenAlexW2016885155MaRDI QIDQ3818783

Publication date: 1989

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230190305

zbMATH Keywords

survey transportation computational methods telecommunication network synthesis water distribution tree-like networks optimum network design minimum cost multicommodity flows

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)

Related Items

Routing of uncertain traffic demands, A distributionally robust joint chance constrained optimization model for the dynamic network design problem under demand uncertainty, Integrating reliability and quality of service in networks with switched virtual circuits, Cost-optimal topology planning of hierarchical access networks, A Lagrangean heuristic for the capacitated concave minimum cost network flow problem, A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs, A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem, A continuous bi-level model for the expansion of highway networks, Maximum flow under proportional delay constraint, On discrete optimization with ordering, General network design: a unified view of combined location and network design problems, Generalized hose uncertainty in single-commodity robust network design, Some thoughts on combinatorial optimisation, A taxonomy of multilayer network design and a survey of transportation and telecommunication applications, Robust minimum cost flow problem under consistent flow constraints, Mathematical formulations for multi-period network design with modular capacity adjustments, Telecommunications network design: Technology impacts and future directions, Scalable timing-aware network design via Lagrangian decomposition, A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem, Benders, metric and cutset inequalities for multicommodity capacitated network design, Optimal Network Design with End-to-End Service Requirements, Approximating some network design problems with node costs, Solving railroad blocking problem using ant colony optimization algorithm, The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles, Finding minimum cost directed trees with demands and capacities, A hybrid algorithm for large-scale service network design considering a heterogeneous fleet, Survivable network design under optimal and heuristic interdiction scenarios, MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem, Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements, Ordered weighted average optimization in multiobjective spanning tree problem, Adaptive memory in multistart heuristics for multicommodity network design, Network design and flow problems with cross-arc costs, Robust optimization model for a dynamic network design problem under demand uncertainty, Multiple Routing Strategies in a Labelled Network, A survey on Benders decomposition applied to fixed-charge network design problems, Global optimization of multilevel electricity market models including network design and graph partitioning, A first multilevel cooperative algorithm for capacitated multicommodity network design, A constraint generation algorithm for large scale linear programs using multiple-points separation, Algorithms for the non-bifurcated network design problem, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design, On the chance-constrained minimum spanning \(k\)-core problem, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints, A fuzzy railroad blocking model with genetic algorithm solution approach for Iranian railways, Optimal solution of the discrete cost multicommodity network design problem, The network redesign problem for access telecommunications networks, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Reliability considerations for process network synthesis problems, A model for the capacitated, hop-constrained, per-packet wireless mesh network design problem, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, 0-1 reformulations of the multicommodity capacitated network design problem, A dual ascent approach to the fixed-charge capacitated network design problem, Optimal lines for railway systems, Planning models for freight transportation, Progressive hedging-based metaheuristics for stochastic network design, Dynamic network design problem under demand uncertainty: an adjustable robust optimization approach, Reduction techniques for the PNS problems: a novel technique and a review, A Learning-Based Matheuristic for Stochastic Multicommodity Network Design, Resource allocation by means of project networks: Dominance results, An exact approach for the multicommodity network optimization problem with a step cost function, Service network design in freight transportation, A capacity allocation problem with integer side constraints, The single-node dynamic service scheduling and dispatching problem, Diversification strategies in local search for a nonbifurcated network loading problem, Exact solution of multicommodity network optimization problems with general step cost functions, Algorithms for a multi-level network optimization problem, Strongly polynomial algorithm for two special minimum concave cost network flow problems, A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem, Models for planning capacity expansion in local access telecommunication networks, Hardware configuration for StarLAN 10 local area networks: An application of integer programming

Cites Work