An oracle-based framework for robust combinatorial optimization (Q6183084): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-023-01271-2 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4317932976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3102800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3452586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Polyhedral Approximation Framework for Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max-min robust combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust combinatorial optimization under convex and discrete cost uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active set algorithm for robust combinatorial optimization based on separation oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / 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: Restricted simplicial decomposition: Computation and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the frank and Wolfe method of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle-based algorithms for binary two-stage robust optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order and stochastic optimization methods for machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial Decomposition with Disaggregated Representation for the Traffic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting-set methods for robust convex optimization with pessimizing oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted simplicial decomposition for convex constrained problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decomposition in nonlinear programming algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-023-01271-2 / rank
 
Normal rank

Latest revision as of 19:12, 30 December 2024

scientific article; zbMATH DE number 7795427
Language Label Description Also known as
English
An oracle-based framework for robust combinatorial optimization
scientific article; zbMATH DE number 7795427

    Statements

    An oracle-based framework for robust combinatorial optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 January 2024
    0 references
    robust optimization
    0 references
    global optimization
    0 references
    simplicial decomposition
    0 references
    0 references
    0 references

    Identifiers