Branch-and-Bound Methods: General Formulation and Properties
From MaRDI portal
Cited in
(46)- Algorithms for parametric nonconvex programming
- Multi-commodity supply network planning in the forest supply chain
- Solving the median problem with continuous demand on a network
- Using branch-and-bound algorithms to obtain suboptimal solutions
- An introduction to parallel dynamic programming
- Parallel best-first branch-and-bound in discrete optimization: a framework
- Towards an abstract parallel branch and bound machine
- Exact and approximate solutions to the multisource weber problem
- Optimization problems in multivariable fuzzy predictive control
- A discrete meta-control procedure for approximating solutions to binary programs
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
- General branch and bound, and its relation to A^* and AO^*
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Optimal dispatching strategy on an airline network after a schedule perturbation
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- Pareto optimality and robustness in bi-blending problems
- DASH: dynamic approach for switching heuristics
- A branch and bound algorithm for the maximum clique problem
- Fast numerical solver of Ising optimization problems via pruning and domain selection
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming
- An effective structured approach to finding optimal partitions of networks
- Branch-and-bound algorithm for a competitive facility location problem
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
- Depth-m search in branch-and-bound algorithms
- Recursive branch and bound
- Multiple testing of mix-and-match feature sets in multi-omics
- Link-based system optimum dynamic traffic assignment problems in general networks
- Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- Branch-and-bound as a higher-order function
- A simulation tool for the performance evaluation of parallel branch and bound algorithms
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Dominance rules in combinatorial optimization problems
- An approach for solving a class of transportation scheduling problems
- Maximum-likelihood detection based on branch and bound algorithm for MIMO systems
- Core group placement: allocation and provisioning of heterogeneous resources
- New approach to solve unconstrained binary quadratic problem
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- A binary integer linear program with multi-criteria and multi-constraint levels
- scientific article; zbMATH DE number 3759389 (Why is no real title available?)
- Discrete solutions to engineering design problems
- Heuristics and their design: A survey
- P2P B&B and GA for the Flow-Shop Scheduling Problem
- Optimization issues in predictive control with fuzzy objective functions
This page was built for publication: Branch-and-Bound Methods: General Formulation and Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632358)
