A combinatorial branch-and-bound algorithm for box search (Q2339825): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Complexity of Geometric Problems in High Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum box problem and its application to data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP: solving constraint integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank

Revision as of 23:16, 9 July 2024

scientific article
Language Label Description Also known as
English
A combinatorial branch-and-bound algorithm for box search
scientific article

    Statements

    Identifiers