Polymatroids and mean-risk minimization in discrete optimization
From MaRDI portal
Publication:957370
DOI10.1016/j.orl.2008.04.006zbMath1210.90127OpenAlexW1978686733MaRDI QIDQ957370
Vishnu Narayanan, Atamtürk, Alper
Publication date: 27 November 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2008.04.006
Related Items
Submodular Formulations for Range Assignment Problems, Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms, Fractional 0-1 programming and submodularity, Robust combinatorial optimization with knapsack uncertainty, Aircraft Rescheduling with Cruise Speed Control, A polyhedral approach to bisubmodular function minimization, Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification, An FPTAS for optimizing a class of low-rank functions over a polytope, Two-echelon supply chain network design with trade credit, Using submodularity in solving the robust bandwidth packing problem with queuing delay guarantees, A note on the implications of approximate submodularity in discrete optimization, Strong valid inequalities for a class of concave submodular minimization problems under cardinality constraints, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, Chance-constrained set covering with Wasserstein ambiguity, A Frank-Wolfe based branch-and-bound algorithm for mean-risk optimization, Submodularity in Conic Quadratic Mixed 0–1 Optimization, Lifting of probabilistic cover inequalities, On distributionally robust chance constrained programs with Wasserstein distance, A novel probabilistic formulation for locating and sizing emergency medical service stations, Robust combinatorial optimization under convex and discrete cost uncertainty, Polyhedral results for a class of cardinality constrained submodular minimization problems, A computational study for common network design in multi-commodity supply chains, Robust budget allocation via continuous submodular functions, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, Risk averse submodular utility maximization, Capacitated location model with online demand pooling in a multi-channel supply chain, Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information, Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra, Strong formulations for conic quadratic optimization with indicator variables, Robustness Concepts for Knapsack and Network Design Problems Under Data Uncertainty, Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity, Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model, Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction, A PTAS for a class of binary non-linear programs with low-rank functions, An exact cutting plane method for \(k\)-submodular function maximization, The submodular knapsack polytope, A Mixed-Integer Fractional Optimization Approach to Best Subset Selection, Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens, Submodular function minimization and polarity, Sequence independent lifting for a set of submodular maximization problems
Cites Work
- Unnamed Item
- Robust linear optimization under general norms.
- Submodular function minimization
- Stochastic spanning tree problem
- Robust discrete optimization and network flows
- Robust optimization-methodology and applications
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Convexity and decomposition of mean-risk stochastic programs
- Strong formulations of robust mixed 0-1 programming
- Submodular functions and optimization.
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Capacitated warehouse location model with risk pooling
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
- The Price of Robustness
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- An analysis of approximations for maximizing submodular set functions—I
- Robust Solutions to Uncertain Semidefinite Programs
- Introduction to Stochastic Programming
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Cuts for Conic Mixed-Integer Programming
- On Polyhedral Approximations of the Second-Order Cone
- Stochastic finance. An introduction in discrete time
