A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Presolve Reductions in Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed Integer Programming: Analyzing 12 Years of Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations of robust mixed 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict graphs in solving integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed vertex packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of uncertain linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress in computational mixed integer programming -- a look back from the other side of the tipping point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and cutting planes with conflict graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The feasibility pump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in robust optimization: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / 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: A short note on the robust combinatorial optimization problems with cardinality constrained uncertainty / 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: On learning and branching: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Robust Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank

Latest revision as of 09:37, 2 August 2024

scientific article; zbMATH DE number 7716156
Language Label Description Also known as
English
A branch and bound algorithm for robust binary optimization with budget uncertainty
scientific article; zbMATH DE number 7716156

    Statements

    A branch and bound algorithm for robust binary optimization with budget uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2023
    0 references
    robust optimization
    0 references
    combinatorial optimization
    0 references
    mathematical programming
    0 references
    branch and bound
    0 references
    computation
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references