Solving the optimal network problem

DOI10.1016/0377-2217(79)90118-8zbMath0424.90074OpenAlexW2041243874MaRDI QIDQ1135216

A. I. Hinxman, T. Brian Boffey

Publication date: 1979

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(79)90118-8

zbMATH Keywords

transportationbranch and bound algorithmheuristic methodcalculation of lower boundsconcept of forced movesoptimal network problemvarious approximations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items

Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design ⋮ Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité ⋮ Heuristic methods and applications: A categorized survey ⋮ Models for planning capacity expansion in local access telecommunication networks

Cites Work

• Unnamed Item
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• The complexity of the network design problem
• Exact and approximate algorithms for optimal network design
• A Computational Approach to the Selection of an Optimal Network