Note—On the Use of Fictitious Bounds in Tree Search Algorithms

DOI10.1287/mnsc.23.8.904zbMath0361.90031OpenAlexW2081232059MaRDI QIDQ4135206

Alwalid N. Elshafei, Mokhtar S. Bazaraa

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.8.904

Mathematics Subject Classification ID

Integer programming (90C10) Search theory (90B40)

Related Items

A heuristic procedure for solving the quadratic assignment problem, The traveling salesman problem: A duality approach, Future paths for integer programming and links to artificial intelligence, Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm