Branch-and-Bound Methods: A Survey
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization
- Relaxed maximum a posteriori fault identification
- A graph approach to generate all possible regression submodels
- A tutorial on geometric programming
- Hybridizing exact methods and metaheuristics: a taxonomy
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Mixed linear system estimation and identification
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- Branch \& Sample: A simple strategy for constraint satisfaction
- Heuristics and their design: A survey
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem
- Algorithms for parametric nonconvex programming
- An effective structured approach to finding optimal partitions of networks
- Branch-and-bound as a higher-order function
- On the complexity of admissible search algorithms
- An analysis of alpha-beta pruning
- A language and a program for stating and solving combinatorial problems
- Branching from the largest upper bound. Folklore and facts
- An approach for solving a class of transportation scheduling problems
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A new node selection strategy in the branch-and-bound procedure
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- A binary integer linear program with multi-criteria and multi-constraint levels
- A note on the complexity of the asymmetric traveling salesman problem
- A hybrid approach to resolving a differentiable integer program.
- Nurse rostering problems -- a bibliographic survey.
- Nagging: A scalable fault-tolerant paradigm for distributed search
- Truck routing and scheduling
- Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks
- On parallel branch and bound frameworks for global optimization
- Generating constrained length personalized bicycle tours
- Gradient surfing: a new deterministic approach for low-dimensional global optimization
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- An optimization approach to epistasis detection
- Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- The heuristic search under conditions of error
- On the computational complexity of 2-interval pattern matching problems
- Stability analysis of tree structured decision functions
- Executing join queries in an uncertain distributed environment
- Allocating relations in a distributed database system
- Construction of a fault location algorithm
- Pruning with improving sequences in lazy functional programs
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- Some new perspectives for solving 0--1 integer programming problems using balas method
- A dual approach to multi-dimensional assignment problems
- Efficient local search for pseudo Boolean optimization
- Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic
- Cost-based optimization of steel frame member sizing and connection type using dimension increasing search
- Modularity maximization to design contiguous policy zones for pandemic response
- Sparse high-dimensional regression: exact scalable algorithms and phase transitions
- Contention-resolving model predictive control for coupled control systems with a shared resource
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Heuristics for packing semifluids
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Anytime pack search
- Dragline operation modelling and task assignment based on mixed-integer linear programming
- Probabilistic transitivity in sports
- Variations and extension of the convex-concave procedure
- Sensitivity analysis for symmetric 2-peripatetic salesman problems
- Embedded variable selection method using signomial classification
- A simplex grey wolf optimizer for solving integer programming and minimax problems
- Portfolio optimization with linear and fixed transaction costs
- Staffing a software project: A constraint satisfaction and optimization-based approach
- Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming
- Discrete search and the Neyman-Pearson lemma
- Heuristic search viewed as path finding in a graph
- An algorithm to generate prime implicants and its application to the selection problem
- Solving the median problem with continuous demand on a network
- Discrete heat transfer search for solving travelling salesman problem
- A study of complexity transitions on the asymmetric traveling salesman problem
- Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems
- Control of perceptual attention in robot driving
- Global solutions to folded concave penalized nonconvex learning
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Hybridizations of metaheuristics with branch \& bound derivates
- Uncertainty quantification via codimension-one partitioning
- Using branch-and-bound algorithms to obtain suboptimal solutions
- The uniform minimum-ones 2SAT problem and its application to haplotype classification
- Static and dynamic resource allocation models for recovery of interdependent systems: application to the Deepwater Horizon oil spill
- Heuristic search under contract
- Solving constrained optimization problems by solution-based decomposition search
- Flowshop/no-idle scheduling to minimise the mean flowtime
- Multi-operator based biogeography based optimization with mutation for global numerical optimization
- Towards the design of an optimal mixer
- Exploring or reducing noise? A global optimization algorithm in the presence of noise
- Improved penalty calculations for a mixed integer branch-and-bound algorithm
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Depth-m search in branch-and-bound algorithms
- Dominance rules in combinatorial optimization problems
- Models and algorithms to improve earthwork operations in road design using mixed integer linear programming
- Minimizing Mean Completion Time for Special Flowshop Problems
- Constraint Satisfaction
- A new approach to partial constraint satisfaction problems
- Optimization issues in predictive control with fuzzy objective functions
- Tabu Search for Vehicle Routing Problems (VRPs)
- A general system for heuristic minimization of convex functions over non-convex sets
This page was built for publication: Branch-and-Bound Methods: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5519733)
