On the public citation graph

Optimal Network Problem: A Branch-and-Bound Algorithm

0 signed · 106 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01944053openalex-snapshot
A PROGRAMMING MODEL OF AN INTEGRATED TRANSPORTATION NETWORK
inferredcites →https://doi.org/10.1007/bf01952728openalex-snapshot
THE ROLE OF TOPOLOGY AND GEOMETRY IN OPTIMAL NETWORK DESIGN
inferredcites →https://doi.org/10.1016/0041-1647(68)90105-6openalex-snapshot
An investment policy to reduce the travel time in a transportation network
inferredcites →https://doi.org/10.1016/0041-1647(69)90152-xopenalex-snapshot
The optimal network problem: Some computational procedures
inferredcites →https://doi.org/10.1016/0041-1647(69)90163-4openalex-snapshot
Journal of transport economics and policy
inferredcites →https://doi.org/10.1016/0041-1647(75)90059-3openalex-snapshot
Optimization of transport networks
inferredcites →https://doi.org/10.1068/a020267openalex-snapshot
Optimal Transportation Networks: A Case Study of Highway Systems
inferredcites →https://doi.org/10.1080/00401706.1971.10488871openalex-snapshot
Integer and Nonlinear Programming
inferredcites →https://doi.org/10.1093/biomet/54.3-4.357openalex-snapshot
The Discarding of Variables in Multivariate Analysis
inferredcites →https://doi.org/10.1287/mnsc.13.4.b176openalex-snapshot
Optimum Seeking with Branch and Bound
inferredcites →https://doi.org/10.1287/opre.11.6.972openalex-snapshot
An Algorithm for the Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.1287/opre.16.3.538openalex-snapshot
The Traveling Salesman Problem: A Survey
inferredcites →https://doi.org/10.1287/trsc.4.1.36openalex-snapshot
The Method of Competing Links
inferredcites →https://doi.org/10.2307/2282945openalex-snapshot
Programming, Games and Transportation Networks.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/atr.5670210104openalex-snapshot
Heuristic ranking and selection procedures for network design problems
inferred← citeshttps://doi.org/10.1002/atr.5670250302openalex-snapshot
Designing personal rapid transit (PRT) networks
inferred← citeshttps://doi.org/10.1002/ett.1053openalex-snapshot
Heuristic methods for topological design of telecommunication networks
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1989.tb00320.xopenalex-snapshot
An Algorithm for Designing Survivable Networks
inferred← citeshttps://doi.org/10.1002/net.21546openalex-snapshot
Bicriterion discrete equilibrium network design problem
inferred← citeshttps://doi.org/10.1002/net.3230090104openalex-snapshot
Exact and approximate algorithms for optimal network design
inferred← citeshttps://doi.org/10.1002/net.3230130309openalex-snapshot
Lower planes for the network design problem
inferred← citeshttps://doi.org/10.1002/net.3230150306openalex-snapshot
Probabilistic analysis of a network design problem heuristic
inferred← citeshttps://doi.org/10.1002/net.3230170202openalex-snapshot
New lower planes for the network design problem
inferred← citeshttps://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferred← citeshttps://doi.org/10.1007/978-1-4419-0820-9_14openalex-snapshot
An Active-set Algorithm for Discrete Network Design Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3754-6_17openalex-snapshot
A Fuzzy, Heuristic, Interactive Approach to the Optimal Network Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-36687-2_73openalex-snapshot
Gumbel-Softmax Optimization: A Simple General Framework for Combinatorial Optimization Problems on Graphs
inferred← citeshttps://doi.org/10.1007/bf01935151openalex-snapshot
A branch-and-bound/flow-equilbrium algorithm for the approximate solution of total cost minimization problems in traffic networks
inferred← citeshttps://doi.org/10.1007/bf01943239openalex-snapshot
Heuristics and design
inferred← citeshttps://doi.org/10.1007/bf02071976openalex-snapshot
Models for planning capacity expansion in local access telecommunication networks
inferred← citeshttps://doi.org/10.1007/bfb0083472openalex-snapshot
Topological network synthesis
inferred← citeshttps://doi.org/10.1007/bfb0121090openalex-snapshot
Tailoring Benders decomposition for uncapacitated network design
inferred← citeshttps://doi.org/10.1007/s10732-005-7000-4openalex-snapshot
A GRASP and Path Relinking Heuristic for Rural Road Network Development
inferred← citeshttps://doi.org/10.1007/s11067-012-9173-3openalex-snapshot
A Branch and Bound Algorithm for Bi-level Discrete Network Design Problem
inferred← citeshttps://doi.org/10.1007/s11116-004-8246-7openalex-snapshot
Application of Ant System to network design problem
inferred← citeshttps://doi.org/10.1016/0038-0121(82)90008-8openalex-snapshot
Redistricting reformulated: A maximum interaction/minimum separation objective
inferred← citeshttps://doi.org/10.1016/0166-0462(78)90010-8openalex-snapshot
Simultaneous optimization of land use and transportation
inferred← citeshttps://doi.org/10.1016/0191-2615(79)90004-3openalex-snapshot
Continuous equilibrium network design models
inferred← citeshttps://doi.org/10.1016/0191-2615(79)90005-5openalex-snapshot
A discrete-convex programming approach to the simultaneous optimization of land use and transportation
inferred← citeshttps://doi.org/10.1016/0191-2615(79)90006-7openalex-snapshot
Application of optimal subset selection to problems of design and scheduling in urban transportation networks
inferred← citeshttps://doi.org/10.1016/0191-2615(79)90007-9openalex-snapshot
Solutions to the optimal network design problem with shipments related to transportation cost
inferred← citeshttps://doi.org/10.1016/0191-2615(80)90040-5openalex-snapshot
A discrete transportation network design problem with combined trip distribution and assignment
inferred← citeshttps://doi.org/10.1016/0191-2615(82)90030-3openalex-snapshot
Combinatorial programming, statistical optimization and the optimal transportation network problem
inferred← citeshttps://doi.org/10.1016/0191-2615(82)90040-6openalex-snapshot
Approximate algorithms for the discrete network design problem
inferred← citeshttps://doi.org/10.1016/0377-2217(79)90118-8openalex-snapshot
Solving the optimal network problem
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90061-yopenalex-snapshot
Road planning in rural areas of developing countries
inferred← citeshttps://doi.org/10.1016/0895-7177(93)90154-qopenalex-snapshot
A new optimal algorithm for backbone topology design in communications networks
inferred← citeshttps://doi.org/10.1016/0898-1221(81)90134-6openalex-snapshot
An efficient dual approach to the urban road network design problem
inferred← citeshttps://doi.org/10.1016/b978-012557189-0/50024-xopenalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.cie.2018.05.057openalex-snapshot
Large-scale reverse supply chain network design: An accelerated Benders decomposition algorithm
inferred← citeshttps://doi.org/10.1016/j.cor.2003.11.012openalex-snapshot
A survey on benders decomposition applied to fixed-charge network design problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.07.038openalex-snapshot
Hybrid meta-heuristic algorithms for solving network design problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.08.161openalex-snapshot
Estimating the performance of intelligent transport systems wireless services for multimodal logistics applications
inferred← citeshttps://doi.org/10.1016/j.ijleo.2022.170377openalex-snapshot
A modified bacterial foraging algorithm for improving road networks
inferred← citeshttps://doi.org/10.1016/j.jksus.2011.03.001openalex-snapshot
Application of particle swarm optimization to transportation network design problem
inferred← citeshttps://doi.org/10.1016/j.measen.2023.100704openalex-snapshot
A hybrid bacterial foraging – simulated annealing framework for improving road networks
inferred← citeshttps://doi.org/10.1016/j.trb.2004.06.004openalex-snapshot
Solution algorithm for the bi-level discrete network design problem
inferred← citeshttps://doi.org/10.1016/j.tre.2009.04.004openalex-snapshot
Long haul freight network design using shipper–carrier freight flow prediction: A California network improvement case study
inferred← citeshttps://doi.org/10.1016/j.tre.2011.02.001openalex-snapshot
A single-level mixed integer linear formulation for a bi-level discrete network design problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70735-0openalex-snapshot
How Can Specialized Discrete and Convex Optimization Methods Be Married?
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73239-0openalex-snapshot
Network Synthesis and Dynamic Network Optimization
inferred← citeshttps://doi.org/10.1016/s0965-8564(97)88257-2openalex-snapshot
Combined transportation network optimization and spatial allocation of pollution emissions
inferred← citeshttps://doi.org/10.1016/s1388-3437(01)80157-8openalex-snapshot
Topological design of telecommunication networks Nodes and links localization under demand constraints
inferred← citeshttps://doi.org/10.1068/a090857openalex-snapshot
Optimal Selection and Scheduling of Investments in Urban Public Transport Systems
inferred← citeshttps://doi.org/10.1068/a161445openalex-snapshot
Urban Transportation Network-Equilibrium and Design Models: Recent Achievements and Future Prospects
inferred← citeshttps://doi.org/10.1068/a180465openalex-snapshot
Scheduling of Interstate Road and Railway Investments
inferred← citeshttps://doi.org/10.1068/a180485openalex-snapshot
Integration of Supply and Demand Models in Transportation and Location: Problem Formulations and Research Questions
inferred← citeshttps://doi.org/10.1080/03052157408960575openalex-snapshot
HEURISTIC APPROACHES TO ROAD NETWORK OPTIMIZATION
inferred← citeshttps://doi.org/10.1080/03081068808717372openalex-snapshot
A time‐staged multi‐objective network‐design model
inferred← citeshttps://doi.org/10.1080/03081069308717498openalex-snapshot
A heuristic algorithm for solving the discrete network design problem
inferred← citeshttps://doi.org/10.1080/03155986.1978.11731696openalex-snapshot
Etude Et Extension D’Un Algorithme De Murghland
inferred← citeshttps://doi.org/10.1080/09595238100185081openalex-snapshot
Book reviews
inferred← citeshttps://doi.org/10.1109/glocom.2001.965071openalex-snapshot
Topological design of MPLS networks
inferred← citeshttps://doi.org/10.1109/tits.2019.2939544openalex-snapshot
A Robust Network Design Problem Based on the Spatiotemporal Attributes of Activities
inferred← citeshttps://doi.org/10.1111/j.1435-5597.1973.tb00883.xopenalex-snapshot
HEURISTICS AND DESIGN
inferred← citeshttps://doi.org/10.1111/j.1435-5597.1979.tb01070.xopenalex-snapshot
A BRANCH‐AND‐BOUND/FLOW‐EQUILIBRIUM ALGORITHM FOR THE APPROXIMATE SOLUTION OF TOTAL COST MINIMIZATION PROBLEMS IN TRAFFIC NETWORKS
inferred← citeshttps://doi.org/10.1111/j.1467-9493.1984.tb00153.xopenalex-snapshot
RECENT ROUTE DEVELOPMENTS IN TRADITIONAL URBAN AREAS OF SOUTHWESTERN NIGERIA. THE CASE OF ILE‐IFE, 1950 TO 1980
inferred← citeshttps://doi.org/10.1111/j.1538-4632.1997.tb00966.xopenalex-snapshot
A Minimax Method for Finding the k Best “Differentiated” Paths
inferred← citeshttps://doi.org/10.1111/mice.12224openalex-snapshot
A Hybrid Branch‐and‐Bound and Benders Decomposition Algorithm for the Network Design Problem
inferred← citeshttps://doi.org/10.1137/0214064openalex-snapshot
Optimum Communication Spanning Trees in Series-Parallel Networks
inferred← citeshttps://doi.org/10.1137/0601008openalex-snapshot
Worst-Case Analysis of Network Design Problem Heuristics
inferred← citeshttps://doi.org/10.1177/0037549717733063openalex-snapshot
A heuristic algorithm based on leaf photosynthate transport
inferred← citeshttps://doi.org/10.1177/030913257700100303openalex-snapshot
Optimization Models of Transportation Network Improvement
inferred← citeshttps://doi.org/10.1287/ijoc.2023.0074openalex-snapshot
A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design
inferred← citeshttps://doi.org/10.1287/opre.28.3.736openalex-snapshot
An Investment Staging Model for a Bridge Replacement Problem
inferred← citeshttps://doi.org/10.1287/opre.37.5.716openalex-snapshot
A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design
inferred← citeshttps://doi.org/10.1287/trsc.18.1.1openalex-snapshot
Network Design and Transportation Planning: Models and Algorithms
inferred← citeshttps://doi.org/10.1287/trsc.21.3.163openalex-snapshot
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
inferred← citeshttps://doi.org/10.1504/ijlsm.2013.055561openalex-snapshot
A hybrid meta-heuristic algorithm for solving real-life transportation network design problems
inferred← citeshttps://doi.org/10.2139/ssrn.6253809openalex-snapshot
Hybrid Discrete Particle Swarm Optimization for Bi-level Network Design Incorporating Dynamic Project Utilities
inferred← citeshttps://doi.org/10.2208/journalip.11.105openalex-snapshot
A Solution Method for a Uncapacitated Network Design Problem Using a Lagrangean Relaxation Method
inferred← citeshttps://doi.org/10.2208/jscej1969.1979.289_99openalex-snapshot
COMPREHENSIVE TRANSPORTATION MODEL AND ITS APPLICATION TO COMMUTER SERVICE
inferred← citeshttps://doi.org/10.26636/jtit.2002.2.126openalex-snapshot
Greedy randomised adaptive search procedures for topological design of MPLS networks
inferred← citeshttps://doi.org/10.31224/osf.io/3h7ncopenalex-snapshot
Incorporating Variable Demand Assignment Into Discrete Network Design Problem
inferred← citeshttps://doi.org/10.31224/osf.io/h7z4dopenalex-snapshot
Discrete Network Design Problem
inferred← citeshttps://doi.org/10.3141/1617-14openalex-snapshot
Multiperiod Highway Improvement and Construction Scheduling: Model Development and Application
inferred← citeshttps://doi.org/10.3141/2089-10openalex-snapshot
Solution Algorithm for Long-Haul Freight Network Design Using Shipper-Carrier Freight Flow Prediction with Explicit Capacity Constraints
inferred← citeshttps://doi.org/10.4018/978-1-61350-086-6.ch013openalex-snapshot
A Hybrid Lagrangian Relaxation and Tabu Search Method for Interdependent-Choice Network Design Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0705.2125openalex-snapshot
Parallelized approximation algorithms for minimum routing cost spanning trees
inferred← citeshttps://doi.org/10.48550/arxiv.1307.3794openalex-snapshot
The Network Improvement Problem for Equilibrium Routing
inferred← citeshttps://doi.org/10.48550/arxiv.1802.01717openalex-snapshot
Simultaneous Optimization of Signal Timing and Capacity Improvement in Urban Transportation Networks Using Simulated Annealing
inferred← citeshttps://doi.org/10.5507/prf.19.24454481openalex-snapshot
Regiony a regionální taxonomie: koncepty, přístupy, aplikace
inferred← citeshttps://doi.org/10.5539/jmr.v11n1p42openalex-snapshot
A Dichotomic Algorithm for Transportation Network and Land Use Problem
inferred← citeshttps://doi.org/10.5539/jmr.v8n3p94openalex-snapshot
A New Heuristic Method for Transportation Network and Land Use Problem
inferred← citeshttps://doi.org/10.5555/800291.811396openalex-snapshot
A combinatorial programming approach to the joint optimization of land use and transportation
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.