Network Design and Transportation Planning: Models and Algorithms
Data up to Jan 2025
Total Citations Per Year
Abstract
References (91)
Computers and Intractability: A Guide to the Theory of NP-Completeness
1979 • 45,565 citations
Decisions with Multiple Objectives: Preferences and Value Tradeoffs.
1994 • 8,503 citations
Partitioning procedures for solving mixed-variables programming problems
1962 • 3,587 citations
Generalized Benders decomposition
1972 • 2,352 citations
Dynamic Version of the Economic Lot Size Model
2004 • 2,136 citations
Some Theoretical Aspects of Road Traffic Research
1952 • 1,468 citations
An Algorithmic Approach to Network Location Problems. II: Thep-Medians
1979 • 1,282 citations
Multicommodity Distribution System Design by Benders Decomposition * † ‡
2010 • 993 citations
A Dual-Based Procedure for Uncapacitated Facility Location
1978 • 922 citations
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
1977 • 807 citations
An efficient approach to solving the road network equilibrium traffic assignment problem
1975 • 760 citations
The steiner problem in graphs
1971 • 694 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
1981 • 661 citations
A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
1969 • 523 citations
An Algorithm for the Discrete Network Design Problem
1975 • 472 citations
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
1979 • 452 citations
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
1977 • 447 citations
An Algorithm for Separable Nonconvex Programming Problems
1969 • 398 citations
The complexity of the network design problem
1978 • 393 citations
Continuous equilibrium network design models
1979 • 387 citations
A dual ascent approach for steiner tree problems on a directed graph
1984 • 365 citations
Multicommodity network flows—A survey
1978 • 311 citations
Minimum Concave Cost Flows in Certain Networks
1968 • 308 citations
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
1980 • 301 citations
Optimum Communication Spanning Trees
1974 • 269 citations
Valid Linear Inequalities for Fixed Charge Problems
1985 • 243 citations
The Prevalence of Braess' Paradox
1983 • 233 citations
Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
1969 • 229 citations
On the symmetric travelling salesman problem I: Inequalities
1979 • 212 citations
Braess's paradox of traffic flow
1970 • 210 citations
Optimal Routing in a Packet-Switched Computer Network
1974 • 208 citations
Network Optimization with Continuous Control Parameters
1983 • 180 citations
Minimum cost routing for static network models
1971 • 174 citations
On the symmetric travelling salesman problem II: Lifting theorems and facets
1979 • 157 citations
On the symmetric travelling salesman problem: A computational study
1980 • 151 citations
Technical Note—An Algorithm for the p-Median Problem
1977 • 151 citations
Worst-Case and Probabilistic Analysis of a Geometric Location Problem
1981 • 150 citations
An Algorithm for the Traffic Assignment Problem
1974 • 148 citations
State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
1983 • 139 citations
The Braess paradox
1981 • 138 citations
An algorithm for the steiner problem in graphs
1984 • 136 citations
Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
1970 • 136 citations
Worst-Case Analysis of Heuristic Algorithms
1980 • 127 citations
Formulating and solving the network design problem by decomposition
1979 • 126 citations
Fundamentals of Transportation Systems Analysis, Volume 1: Basic Concepts
1979 • 123 citations
Implicit representation of variable upper bounds in linear programming
1975 • 117 citations
Graphentheoretische Methoden und ihre Anwendungen
1969 • 116 citations
Applications of Linear Programming in the Oil Industry
1957 • 108 citations
Optimal Network Problem: A Branch-and-Bound Algorithm
1973 • 103 citations
The Engine Scheduling Problem In A Railway Network
1976 • 100 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
Network Design with Fixed and Variable Cost Elements
1973 • 81 citations
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
1981 • 80 citations
Combinatorial programming, statistical optimization and the optimal transportation network problem
1982 • 77 citations
Transport network optimization in the Dutch integral transportation study
1974 • 71 citations
An algorithm for the min concave cost flow problem
1980 • 67 citations
The optimal network problem: Some computational procedures
1969 • 63 citations
An Optimization Approach to Routing Aircraft
1976 • 61 citations
A Computational Approach to the Selection of an Optimal Network
1973 • 59 citations
The complexity of designing a network with minimum diameter
1981 • 55 citations
Probabilistic Analysis of the Planar k-Median Problem
1980 • 54 citations
On building minimum cost communication networks
1973 • 51 citations
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
1980 • 49 citations
An implementation of the simplex method for linear programming problems with variable upper bounds
1982 • 48 citations
On building minimum cost communication networks over time
1974 • 48 citations
On the symmetric travelling salesman problem II
1979 • 48 citations
Adjacent extreme flows and application to min concave cost flow problems
1979 • 44 citations
Implicit representation of generalized variable upper bounds in linear programming
1978 • 43 citations
A discrete-convex programming approach to the simultaneous optimization of land use and transportation
1979 • 36 citations
An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem
1971 • 36 citations
A generalized upper bounding approach to a communications network planning problem
1977 • 32 citations
A RESEARCH PROGRAM FOR COMPARISON OF TRAFFIC ASSIGNMENT TECHNIQUES
1965 • 28 citations
A fixed matrix method for all shortest distances in a directed graph and for the inverse problem
1970 • 28 citations
Lower planes for the network design problem
1983 • 25 citations
Concave cost minimization on networks
1979 • 25 citations
Solutions to the optimal network design problem with shipments related to transportation cost
1979 • 22 citations
An efficient dual approach to the urban road network design problem
1979 • 20 citations
Solving the optimal network problem
1979 • 20 citations
TRANSPORTATION PLANNING: NETWORK MODELS AND THEIR IMPLEMENTATION
1978 • 20 citations
Application of optimal subset selection to problems of design and scheduling in urban transportation networks
1979 • 17 citations
SELECTING AN OPTIMAL TRAFFIC NETWORK
1968 • 17 citations
OPTIMIZATION FOR SPARSE SYSTEMS
1976 • 16 citations
The structure of the solution set to network optimisation problems
1979 • 13 citations
Using shortest paths in some transshipment problems with concave costs
1977 • 12 citations
OPTIMAL NETWORK GEOMETRY
1974 • 12 citations
A cut‐flow procedure for transportation network optimization
1980 • 6 citations
Optimal flow in networks with gains and costs
1971 • 5 citations