A new node selection strategy in the branch-and-bound procedure

DOI10.1016/0305-0548(94)90040-XzbMath0812.90119OpenAlexW1994332079MaRDI QIDQ1342946

Ching-Jong Liao

Publication date: 15 May 1995

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90040-x

zbMATH Keywords

branch-and-boundlocally best bound rulenode selection strategy

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization

Cites Work

• Use of penalties in a branch and bound procedure for the fixed charge transportation problem
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• An Automatic Method of Solving Discrete Programming Problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• A Survey of Methods for Pure Nonlinear Integer Programming
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Theoretical comparisons of search strategies in branch-and-bound algorithms
• Branch-and-Bound Methods: A Survey
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables

This page was built for publication: A new node selection strategy in the branch-and-bound procedure