Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
type: Item
instance of: scholarly article
title: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
zbMATH Open document ID: 1387.90010
author: David R. Morrison
author: Jason J. Sauppe
author: E. C. Sewell
author: Sheldon H. Jacobson
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6872077
zbMATH Keywords: branch-and-bound
zbMATH Keywords: discrete optimization
zbMATH Keywords: integer programming
zbMATH Keywords: search strategies
zbMATH Keywords: cyclic best first search
zbMATH Keywords: survey
describes a project that uses: SCIP
describes a project that uses: CPLEX
describes a project that uses: Gurobi
describes a project that uses: SYMPHONY
describes a project that uses: FEASPUMP
describes a project that uses: MIPLIB
describes a project that uses: LINDO
describes a project that uses: TSPLIB
describes a project that uses: XPRESS
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.01.005
OpenAlex ID: W2277678953
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: Branch-and-Bound Methods: A Survey
cites work: Q4040221
cites work: Q4217266
cites work: An exact approach for the vertex coloring problem
cites work: Restrict-and-relax search for 0-1 mixed-integer programs
cites work: Generalized best-first search strategies and the optimality of A*
cites work: Exploiting Erraticism in Search
cites work: The feasibility pump
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: Local branching
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
cites work: Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems
cites work: A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis
cites work: Using diversification, communication and parallelism to solve mixed-integer linear programs
cites work: Could we use a million cores to solve an integer program?
cites work: Theoretical comparisons of search strategies in branch-and-bound algorithms
cites work: Backtrack Programming
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Integer-programming software systems
cites work: Depth-first iterative-deepening: An optimal admissible tree search
cites work: Balancing assembly lines effectively -- a computational comparison
cites work: A branch, bound, and remember algorithm for the simple assembly line balancing problem
cites work: Q3651735
cites work: Nested Partitions Method for Global Optimization
cites work: MIP: Theory and practice -- closing the gap
cites work: Constraint Integer Programming: A New Approach to Integrate CP and MIP
cites work: A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
cites work: Probabilistic subproblem selection in branch-and-bound algorithms
cites work: A Column Generation Approach for Graph Coloring
cites work: A Branch-and-Price Algorithm for the Generalized Assignment Problem
cites work: A Wide Branching Strategy for the Graph Coloring Problem
cites work: A fast algorithm for the maximum weight clique problem
cites work: Maximum-weight stable sets and safe lower bounds for graph coloring
cites work: Global optimization using special ordered sets
cites work: A generalized assignment problem with special ordered sets: a polyhedral approach.
cites work: Mixed integer nonlinear programming tools: a practical overview
cites work: An Improved Implicit Enumeration Approach for Integer Programming
cites work: Branching rules revisited
cites work: A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
cites work: Experiments in mixed-integer linear programming
cites work: Q5241193
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: A Computational Study of Search Strategies for Mixed Integer Programming
cites work: Faster integer-feasibility in mixed-integer linear programs by branching to force change

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Backdoor Branching

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Information-theoretic approaches to branching in search

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Information-based branching schemes for binary linear mixed integer problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A branch-and-bound algorithm for assembly line worker assignment and balancing problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Lagrangian duality and branch-and-bound algorithms for optimal power flow

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: The theory of dynamic programming

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: The Power of Dominance Relations in Branch-and-Bound Algorithms

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Pruning moves

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: The multiple resource constrained project scheduling problem: A breadth-first approach

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Pruning by isomorphism in branch-and-cut

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Exploiting orbits in symmetric ILP

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Orbital branching

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Outline of an algorithm for integer solutions to linear programs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Valid inequalities for mixed integer linear programs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Cutting planes in integer and mixed integer programming

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Gomory cuts revisited

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Edmonds polytopes and a hierarchy of combinatorial problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Chvátal closures for mixed integer programming problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Cover and pack inequalities for (mixed) integer programming

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Valid Linear Inequalities for Fixed Charge Problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Aggregation and Mixed Integer Rounding to Solve MIPs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Solving Large-Scale Zero-One Linear Programming Problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Optimizing over the split closure

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Mixed Integer Programming: Analyzing 12 Years of Progress

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Partitioning procedures for solving mixed-variables programming problems

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Generalized Benders decomposition

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Q4840772

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Decomposition Principle for Linear Programs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Branch-and-price: Column generation for solving huge integer programs

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Selected Topics in Column Generation

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Q4198056

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Branching in branch-and-price: A generic scheme

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Exact solution of graph coloring problems via constraint programming and column generation

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Q3184605

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: GRASP: a search algorithm for propositional satisfiability

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Q4411385

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (cites work)
cites work: Conflict analysis in mixed integer programming

Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (DOI)
DOI: 10.1016/J.DISOPT.2016.01.005