A combinatorial branch-and-bound algorithm for box search

DOI10.1016/J.DISOPT.2014.05.001zbMATH Open1308.90151OpenAlexW2123431541MaRDI QIDQ2339825FDOQ2339825

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

data miningcombinatorial optimizationmixed integer programmingbranch-and-bound

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• OPTIMAL DYNAMIC BOX-COUNTING ALGORITHM
• Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
• The maximum box problem and its application to data analysis
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts

Uses Software

• SCIP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339825)