Theoretical comparisons of search strategies in branch-and-bound algorithms
From MaRDI portal
Publication:4192964
Cites work
- scientific article; zbMATH DE number 3351222 (Why is no real title available?)
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Algorithms for Scheduling Independent Tasks
- Backtrack Programming
- Branch-and-Bound Methods: A Survey
- Branch-and-Bound Methods: General Formulation and Properties
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems
- Discrete Programming by the Filter Method
- Experiments in mixed-integer linear programming
- Integer Programming by Implicit Enumeration and Balas’ Method
- Letter to the Editor—A Note on the Branch-and-Bound Principle
- Practical Solution of Large Mixed Integer Programming Problems with Umpire
Cited in
(21)- The stochastic transportation problem with single sourcing
- Discrete optimization methods for multiprocessor computer systems
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
- Some new perspectives for solving 0--1 integer programming problems using balas method
- Probability modeling of branch-and-bound method
- Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
- An extremal problem on random trees
- An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- An effective structured approach to finding optimal partitions of networks
- Depth-m search in branch-and-bound algorithms
- Performances of parallel branch and bound algorithms with best-first search
- A note on anomalies in parallel branch-and-bound algorithms with one-to- one bounding functions
- Using branch-and-bound algorithms to obtain suboptimal solutions
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- Parallel best-first branch-and-bound in discrete optimization: a framework
- Towards an abstract parallel branch and bound machine
- Pareto optimality and robustness in bi-blending problems
- A new node selection strategy in the branch-and-bound procedure
This page was built for publication: Theoretical comparisons of search strategies in branch-and-bound algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192964)
