Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QPsimplex / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2979432854 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1708.02371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and decomposition of mean-risk stochastic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Class of Utility Functions Over the Vertices of a Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for quadratic optimization with M-matrices and indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted polymatroid inequalities for mean-risk optimization with indicator variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for Conic Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroids and mean-risk minimization in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The submodular knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3182207 / 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: Lectures on Modern Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inequalities in Probability Theory: A Convex Optimization Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong inequalities for capacitated survivable network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Classes of Two-Parameter Objectives Over Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm applied to planning the interdiction of stochastic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and sampling to solve a stochastic network interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic maximum flow interdiction problems under heterogeneous risk preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of second-order cone programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:34, 24 July 2024

scientific article
Language Label Description Also known as
English
Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
scientific article

    Statements

    Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2021
    0 references
    0 references
    risk
    0 references
    polymatroids
    0 references
    conic integer optimization
    0 references
    quadratic optimization
    0 references
    stochastic network interdiction
    0 references
    0 references
    0 references
    0 references