A combinatorial branch-and-bound algorithm for box search

DOI10.1016/J.DISOPT.2014.05.001MaRDI QIDQ2339825zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• The maximum box problem and its application to data analysis
• Planar maximum box problem
• A criterion space search algorithm for biobjective integer programming: the balanced box method
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• Publication:3491321

Cites work

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

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

Describes a project that uses

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)