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

DOI10.1016/0305-0548(94)90040-XMaRDI QIDQ1342946zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Node selection strategies in interval branch and bound algorithms
• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
• Faster MIP solutions via new node selection rules
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
• New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
• scientific article; zbMATH DE number 1283855
• scientific article; zbMATH DE number 994413
• A branch and bound algorithm for Choquet optimization in multicriteria problems
• A branch-and-bound algorithm to solve a multi-level network optimization problem
• A new bounding technique in branch-and-bound algorithms for mixed integer programming

Cites work

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

Cited in

(6)

• Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
• scientific article; zbMATH DE number 1054664 (Why is no real title available?)
• scientific article; zbMATH DE number 222693 (Why is no real title available?)
• Probabilistic subproblem selection in branch-and-bound algorithms
• Node selection strategies in interval branch and bound algorithms
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds

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

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