Skip to main content

ETHNOS_APP

Home • Search • Journals • List 0

Optimal Network Problem

A Branch-and-Bound Algorithm

Bibliographic Data

ID4142003
AuthorsDavid E Boyce (0000-0002-9128-4955, University City Science Center), Asaf Farhi, Ralph Weischedel (University of Pennsylvania)
Year1973
Volume5
Issue4
Pages519-533
Publication date1973-08-01
Peer ReviewedYes
Open AccessYes
TypeARTICLE
VenueEnvironment and Planning A Economy and Space (JOURNAL)
Journal identifiersISSN: 0308-518X • E-ISSN: 1472-3409
PublisherSAGE Publications Inc (PUBLISHER)
DOI10.1068/a050519
OpenAlexW2009700296
LanguageEN
Citations received11
References cited11

The problem of selecting a subset of links so as to minimize the sum of shortest path distances between all pairs of nodes, subject to a budget constraint on total length of links, may be solved by a modification of a branch-and-bound algorithm developed for optimal variable selection problems in statistics. The modified algorithm is described in detail, and encouraging computational experience on 10 node networks is reported. The use of the algorithm as a heuristic approach to solving the optimal network problem is also discussed

Algorithm · Branch and bound · Branch and cut · Budget constraint · Heuristic · Integer programming · Mathematical optimization · Shortest path problem · Computer Science · Data Management and Algorithms · Engineering · Mathematics · Multi-Criteria Decision Making · Vehicle Routing Optimization Methods · Artificial Intelligence · Theoretical Computer Science

  • Heuristics and design

    Open Access•Britton Harris•Papers of the Regional Science…•1973

  • Heuristics and Design

    Open Access•Britton Harris•Papers of the Regional Science…•1973

  • A Branch‐and‐bound/Flow‐equilibrium Algorithm for the Approximate Solution of Total Cost Minimization Problems in Traffic Networks

    Open Access•Harry Böttcher, Werner Rothengatter et al.•Papers of the Regional Science…•1979

  • A branch-and-bound/flow-equilbrium algorithm for the approximate solution of total cost minimization problems in traffic networks

    Open Access•Harry Böttcher, Werner Rothengatter et al.•Papers of the Regional Science…•1979

  • Optimization Models of Transportation Network Improvement

    Open Access•Ross D Mackinnon, Gerald M Barber•Progress in Human Geography•1977

  • Recent Route Developments in Traditional Urban Areas of Southwestern Nigeria. The Case of Ile‐ife, 1950 to 1980

    Open Access•Musisi Nkambwe•Singapore Journal of Tropical…•1984

  • Application of Ant System to network design problem

    Open Access•Hossain Poorzahedy, Farhad Abulghasemi•Transportation•2005

  • Integration of Supply and Demand Models in Transportation and Location

    Open Access•David E Boyce•Environment and Planning A…•1986

  • Scheduling of Interstate Road and Railway Investments

    Open Access•Werner Rothengatter•Environment and Planning A…•1986

  • Optimal Selection and Scheduling of Investments in Urban Public Transport Systems

    Open Access•Werner Rothengatter•Environment and Planning A…•1977

  • Urban Transportation Network-Equilibrium and Design Models

    Open Access•David E Boyce•Environment and Planning A…•1984

  • A programming model of an integrated transportation network

    Open Access•Aaron J Scott•Papers of the Regional Science…•1967

  • The role of topology and geometry in optimal network design

    Open Access•Christian Werner•Papers of the Regional Science…•1968

  • Optimal Transportation Networks

    Open Access•Ross D Mackinnon, Michael J Hodgson•Environment and Planning A…•1970

Unique citing works11
Citations per year0,21
Citation span1973 - 2005 (33)
Citation velocityhistorical
Highly citedNo
Citation typesNeutral: 8

Tools

Open DOISci-Hub
Ethnos_APP • Open Source Project • MIT License • Frontend v2.0.0 • Privacy and Cookies • API Documentation: api.ethnos.app/docs • API Source Code: GitHub • DOI: 10.5281/zenodo.17049435 • Frontend Source Code: GitHub • DOI: 10.5281/zenodo.17050053 • cruz.rio.br • Expectantes Misericordiae