Networks synthesis and optimum network design problems: Models, solution methods and applications
Data up to Jan 2025
Total Citations Per Year
Abstract
References (99)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
Flows in networks
1962 • 4,199 citations
Algorithm 97: Shortest path
1962 • 3,849 citations
Partitioning procedures for solving mixed-variables programming problems
1962 • 3,587 citations
The Lagrangian Relaxation Method for Solving Integer Programming Problems
1981 • 2,035 citations
Branch-and-Bound Methods: A Survey
1966 • 1,915 citations
Network Design and Transportation Planning: Models and Algorithms
1984 • 1,259 citations
Lagrangean relaxation for integer programming
1974 • 1,056 citations
An Algorithm for the Traveling Salesman Problem
1963 • 1,029 citations
The traveling-salesman problem and minimum spanning trees: Part II
1971 • 1,010 citations
Multi-Terminal Network Flows
1961 • 959 citations
A Dual-Based Procedure for Uncapacitated Facility Location
1978 • 922 citations
Multicommodity Distribution System Design by Benders Decomposition
1974 • 863 citations
Flows in Networks
1963 • 806 citations
The steiner problem in graphs
1971 • 694 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
An Algorithm for the Discrete Network Design Problem
1975 • 472 citations
Accelerated greedy algorithms for maximizing submodular set functions
2005 • 432 citations
The complexity of the network design problem
1978 • 393 citations
On the Topological Design of Distributed Computer Networks
1977 • 387 citations
A dual ascent approach for steiner tree problems on a directed graph
1984 • 365 citations
Steiner's problem in graphs and its implications
1971 • 344 citations
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
1971 • 319 citations
Multicommodity network flows—A survey
1978 • 311 citations
Minimum Concave Cost Flows in Certain Networks
1968 • 308 citations
Fixed‐cost transportation problems
1961 • 304 citations
An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
1972 • 292 citations
Large-Scale Network Topological Optimization
1977 • 278 citations
Optimum Communication Spanning Trees
1974 • 269 citations
Topological design of centralized computer networks—formulations and algorithms
1982 • 263 citations
A Survey of Linear Cost Multicommodity Network Flows
1978 • 223 citations
An O(|V|3) algorithm for finding maximum flows in networks
1978 • 219 citations
On teleprocessing system design, Part II: A method for approximating the optimal network
1966 • 211 citations
The Transportation-Location Problem
1972 • 199 citations
Cluster Analysis: An Application of Lagrangian Relaxation
1979 • 193 citations
Graphes et algorithmes
1981 • 187 citations
A branch‐bound algorithm for the capacitated facilities location problem
1969 • 182 citations
The complexity of the capacitated tree problem
1978 • 180 citations
Minimum cost routing for static network models
1971 • 174 citations
The Loading Problem
1971 • 162 citations
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
1983 • 158 citations
Algorithms for the Simple Plant-Location Problem with Some Side Conditions
1969 • 148 citations
An integer linear programming approach to the steiner problem in graphs
1980 • 144 citations
Optimization of Transport Networks
1974 • 143 citations
An algorithm for the steiner problem in graphs
1984 • 136 citations
Optimization of transport networks
1975 • 129 citations
Formulating and solving the network design problem by decomposition
1979 • 126 citations
Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
1971 • 120 citations
The fixed charge problem
1970 • 116 citations
Topological optimization of computer networks
1972 • 113 citations
Optimal Network Problem: A Branch-and-Bound Algorithm
1973 • 103 citations
Exact and approximate algorithms for optimal network design
1979 • 98 citations
Worst-Case Analysis of Network Design Problem Heuristics
1980 • 95 citations
Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
1982 • 87 citations
A Dual-Bounded Algorithm for the p-Median Problem
1980 • 85 citations
The Capacitated Minimum Spanning Tree
1973 • 82 citations
Network Design with Fixed and Variable Cost Elements
1973 • 81 citations
Synthesis of a Communication Network
1964 • 79 citations
The Design or Multipoint Linkages in a Teleprocessing Tree Network
1972 • 77 citations
An Application of Generalized Linear Programming to Network Flows
1962 • 74 citations
An algorithm for the min concave cost flow problem
1980 • 67 citations
Centralized teleprocessing network design
1983 • 65 citations
The optimal network problem: Some computational procedures
1969 • 63 citations
A simple version of Karzanov's blocking flow algorithm
1984 • 61 citations
A Computational Approach to the Selection of an Optimal Network
1973 • 59 citations
A New Class of Algorithms for Multipoint Network Optimization
1976 • 57 citations
Computing capacitated minimal spanning trees efficiently
1974 • 54 citations
MATHEMATICAL PROGRAMMING
1984 • 54 citations
Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
1981 • 52 citations
On building minimum cost communication networks
1973 • 51 citations
On building minimum cost communication networks over time
1974 • 48 citations
Topological Design of Multipoint Teleprocessing Networks
1974 • 45 citations
Minimum cost routing for dynamic network models
1973 • 45 citations
Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design
1980 • 42 citations
An investment policy to reduce the travel time in a transportation network
1968 • 39 citations
An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
1971 • 36 citations
Optimal expansion of an existing network
1974 • 34 citations
The One-Terminal TELPAK Problem
1971 • 33 citations
Optimization of Teleprocessing Networks with Concentrators and Multiconnected Terminals
1978 • 25 citations
Multiflots de coût minimal avec fonctions de coût concaves
1976 • 25 citations
Concave cost minimization on networks
1979 • 25 citations
Lower planes for the network design problem
1983 • 25 citations
Computer Communications Network Design and Analysis
1977 • 23 citations
Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints
1981 • 22 citations
Solving the optimal network problem
1979 • 20 citations
An efficient dual approach to the urban road network design problem
1979 • 20 citations
SELECTING AN OPTIMAL TRAFFIC NETWORK
1968 • 17 citations
Synthèse optimale d’un réseau de télécommunication avec contraintes de sécurité
1981 • 15 citations
Planification a court et a moyen terme d’un réseau de télécommunications
1974 • 14 citations
Computer Design of Electricity Supply Networks by a Heuristic Method
1966 • 13 citations
The structure of the solution set to network optimisation problems
1979 • 13 citations
HEURISTIC APPROACHES TO ROAD NETWORK OPTIMIZATION
1974 • 11 citations
On the fixed cost flow problem†
1972 • 10 citations
Computational Complexity of Network Design Algorithms.
1977 • 8 citations
The design of large-scale networks
1972 • 8 citations
Book of Interest
1975 • 5 citations
Optimization Techniques
1976 • 3 citations
Combinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem
1980 • 2 citations