A combinatorial branch-and-bound algorithm for box search

DOI10.1016/j.disopt.2014.05.001zbMath1308.90151OpenAlexW2123431541MaRDI QIDQ2339825

Quentin Louveaux, S. Mathieu

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.05.001

zbMATH Keywords

combinatorial optimizationbranch-and-boundmixed integer programmingdata mining

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts

Uses Software

• SCIP

Cites Work

• Unnamed Item
• SCIP: solving constraint integer programs
• The maximum box problem and its application to data analysis
• Branching rules revisited
• Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
• An Automatic Method of Solving Discrete Programming Problems
• The Complexity of Geometric Problems in High Dimension
• A Computational Study of Search Strategies for Mixed Integer Programming
• Experiments in mixed-integer linear programming

This page was built for publication: A combinatorial branch-and-bound algorithm for box search