Branch-and-Bound Methods: A Survey
From MaRDI portal
Publication:5519733
DOI10.1287/opre.14.4.699zbMath0143.42501OpenAlexW2144931885WikidataQ56851485 ScholiaQ56851485MaRDI QIDQ5519733
Publication date: 1966
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.14.4.699
Related Items
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben, Translating statements of symbolic logic into zero-one linear programming, Definition of extraction files and their optimization by zero-one programming, A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables, Consistency Cuts for Dantzig-Wolfe Reformulations, Tabu Search for Vehicle Routing Problems (VRPs), Unnamed Item, On black-box optimization in divide-and-conquer SAT solving, HEURISTIC SEARCH UNDER CONTRACT, A branch and bound method solving the max–min linear discriminant analysis problem, MINLP‐based hybrid strategy for operating mode selection of TES‐backed‐up refrigeration systems, Controller placement problem in software‐defined networking: A survey, Efficient hybrid Bayesian optimization algorithm with adaptive expected improvement acquisition function, Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach, A new taxonomy of global optimization algorithms, Exact and approximate solutions to the multisource weber problem, Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm, Comparison of parallel implementations of the branch-and-bound method for shared memory systems, Variable neighborhood search approach with intensified shake for monitor placement, Les procedures arborescentes d’optimisation, An STL-based Approach to Resilient Control for Cyber-Physical Systems, A branch-and-bound approach to the no-idle flowshop scheduling problem, Investigation of some branch and bound strategies for the solution of mixed integer linear programs, An implicit enumeration program for zero-one integer programming, Direct Gravitational Search Algorithm for Global Optimisation Problems, Minimizing Mean Completion Time for Special Flowshop Problems, Improved penalty calculations for a mixed integer branch-and-bound algorithm, A general system for heuristic minimization of convex functions over non-convex sets, Optimal design of experiments for estimating the time of death in forensic medicine, A new approach to partial constraint satisfaction problems, Towards the design of an optimal mixer, A branch and bound algorithm for the maximum clique problem, Optimization issues in predictive control with fuzzy objective functions, A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\), Statistical mechanics methods and phase transitions in optimization problems, Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs, Performance of linear-space search algorithms, Flowshop/no-idle scheduling to minimise the mean flowtime, A simple effective heuristic for embedded mixed-integer quadratic programming, Performance of linear-space search algorithms, A New Algorithm To Solve Vehicle Routing Problems (VRPs), Link-Based System Optimum Dynamic Traffic Assignment Problems in General Networks, Constraint Satisfaction, Theoretical comparisons of search strategies in branch-and-bound algorithms, Depth-m search in branch-and-bound algorithms, Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited, A new approach to partial constraint satisfaction problems, Exact Solution of Two Location Problems via Branch-and-Bound, Unnamed Item, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, High generalization performance structured self-attention model for knapsack problem, Variations and extension of the convex-concave procedure, Nagging: A scalable fault-tolerant paradigm for distributed search, Global solutions to folded concave penalized nonconvex learning, Heuristic methods for minimum-cost pipeline network design -- a node valency transfer metaheuristic, Tikhonov, Ivanov and Morozov regularization for support vector machine learning, Sensitivity analysis for symmetric 2-peripatetic salesman problems, On the computational complexity of 2-interval pattern matching problems, Stability analysis of tree structured decision functions, A new node selection strategy in the branch-and-bound procedure, Static and dynamic resource allocation models for recovery of interdependent systems: application to the Deepwater Horizon oil spill, Solving the median problem with continuous demand on a network, Truck routing and scheduling, Solving constrained optimization problems by solution-based decomposition search, Executing join queries in an uncertain distributed environment, Allocating relations in a distributed database system, Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks, Fast local search and guided local search and their application to British Telecom's workforce scheduling problem, Multi-operator based biogeography based optimization with mutation for global numerical optimization, Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems, Embedded variable selection method using signomial classification, Construction of a fault location algorithm, Cost-based optimization of steel frame member sizing and connection type using dimension increasing search, A binary integer linear program with multi-criteria and multi-constraint levels, A note on the complexity of the asymmetric traveling salesman problem, A simplex grey wolf optimizer for solving integer programming and minimax problems, Modularity maximization to design contiguous policy zones for pandemic response, 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, Sparse high-dimensional regression: exact scalable algorithms and phase transitions, Exploring or reducing noise? A global optimization algorithm in the presence of noise, Discrete heat transfer search for solving travelling salesman problem, Pruning with improving sequences in lazy functional programs, On parallel branch and bound frameworks for global optimization, 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, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, Hybridizations of Metaheuristics With Branch & Bound Derivates, Dominance rules in combinatorial optimization problems, Models and algorithms to improve earthwork operations in road design using mixed integer linear programming, A hybrid approach to resolving a differentiable integer program., Heuristics and their design: A survey, Nurse rostering problems -- a bibliographic survey., Probabilistic analysis of solving the assignment problem for the traveling salesman problem, Algorithms for parametric nonconvex programming, Contention-resolving model predictive control for coupled control systems with a shared resource, An effective structured approach to finding optimal partitions of networks, A heterogeneous cooperative parallel search of branch-and-bound method and tabu search algorithm, Testing restorable systems: formal definition and heuristic solution based on river formation dynamics, Generating constrained length personalized bicycle tours, Gradient surfing: a new deterministic approach for low-dimensional global optimization, Branch-and-bound as a higher-order function, Weighted heuristic anytime search: new schemes for optimization over graphical models, Disturbance rejection control based on state-reconstruction and persistence disturbance estimation, Uncertainty quantification via codimension-one partitioning, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems, An optimization approach to epistasis detection, 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, Using branch-and-bound algorithms to obtain suboptimal solutions, An efficient data structure for branch-and-bound algorithm, Evaluating the impact of AND/OR search on 0-1 integer linear programming, Branch and bound algorithms for maximizing expected improvement functions, On the complexity of admissible search algorithms, A perturb biogeography based optimization with mutation for global numerical optimization, An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem, An analysis of alpha-beta pruning, Orientational variable-length strip covering problem: a branch-and-price-based algorithm, The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification, A language and a program for stating and solving combinatorial problems, Branching from the largest upper bound. Folklore and facts, Heuristics for packing semifluids, An approach for solving a class of transportation scheduling problems, Polynomial-time approximation algorithms for anchor-free TDoA localization, Discrete search and the Neyman-Pearson lemma, Some new perspectives for solving 0--1 integer programming problems using balas method, A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization, A dual approach to multi-dimensional assignment problems, Relaxed maximum a posteriori fault identification, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, A graph approach to generate all possible regression submodels, Heuristic search viewed as path finding in a graph, Anytime pack search, A tutorial on geometric programming, Dragline operation modelling and task assignment based on mixed-integer linear programming, Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem, An algorithm to generate prime implicants and its application to the selection problem, Hybridizing exact methods and metaheuristics: a taxonomy, A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures, AND/OR branch-and-bound search for combinatorial optimization in graphical models, Probabilistic transitivity in sports, Mixed linear system estimation and identification, The heuristic search under conditions of error, General branch and bound, and its relation to \(A^*\) and \(AO^*\), A branch and bound algorithm for symmetric 2-peripatetic salesman problems, The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm, An improved branch and bound algorithm for mixed integer nonlinear programs, Efficient local search for pseudo Boolean optimization
