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

DOI10.1287/MNSC.23.8.904MaRDI QIDQ4135206zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(5)

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

This page was built for publication: Note—On the Use of Fictitious Bounds in Tree Search Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4135206)