Distributionally robust mixed integer linear programs: persistency models with applications
From MaRDI portal
Publication:296964
DOI10.1016/j.ejor.2013.07.009zbMath1339.90248OpenAlexW3124801529WikidataQ93668466 ScholiaQ93668466MaRDI QIDQ296964
Chung-Piaw Teo, Zhichao Zheng, Xiao-bo Li, Karthik Natarajan
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/lkcsb_research/3629
Mixed integer programming (90C11) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)
Related Items
K-Adaptability in Two-Stage Robust Binary Programming ⋮ An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix ⋮ An approach to the distributionally robust shortest path problem ⋮ Data-Driven Decisions for Problems with an Unspecified Objective Function ⋮ On reduced semidefinite programs for second order moment bounds with applications ⋮ $K$-adaptability in two-stage distributionally robust binary programming ⋮ Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls ⋮ Robust Quadratic Programming with Mixed-Integer Uncertainty
Uses Software
Cites Work
- Copositive optimization -- recent developments and applications
- Random assignment problems
- Geometric algorithms and combinatorial optimization
- Resistance bounds for first-passage percolation and maximum flow
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- A proof of Parisi's conjecture on the random assignment problem
- Covariance spaces for measures on polyhedral sets
- Multi-resource investment strategies: Operational hedging under demand uncertainty
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Bounds on measures satisfying moment conditions.
- Distributionally robust joint chance constraints with second-order moment information
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Persistence in discrete optimization under data uncertainty
- Global Optimization with Polynomials and the Problem of Moments
- The ?(2) limit in the random assignment problem
- Persistency in 0-1 Polynomial Programming
- On the Translocation of Masses
- Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
- On the Complexity of Nonoverlapping Multivariate Marginal Bounds for Probabilistic Combinatorial Optimization Problems
- A “Joint+Marginal” Approach to Parametric Polynomial Optimization
- A Variational Approach to Copositive Matrices
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Persistency Model and Its Applications in Choice Modeling
- Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion
- Convex majorization with an application to the length of critical paths
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Generalized Chebyshev Bounds via Semidefinite Programming
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Bounding the Project Completion Time Distribution in PERT Networks
- A Variable-Complexity Norm Maximization Problem
- Robustness against dependence in PERT: An application of duality and distributions with known marginals
- On Approximations for Queues, I: Extremal Distributions
- Approximating the Criticality Indices of the Activities in PERT Networks
- Stochastic Bounds on Distributions of Optimal Value Functions with Applications to PERT, Network Flows and Reliability
- Roof duality for polynomial 0–1 optimization
- Some NP-complete problems in quadratic and nonlinear programming
- A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
- Vertex packings: Structural properties and algorithms
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Efficient Estimation of Arc Criticalities in Stochastic Activity Networks
- Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis
- Bounds on Expected Project Tardiness
- Application of a Technique for Research and Development Program Evaluation
- Expected Critical Path Lengths in PERT Networks
- Choice Prediction With Semidefinite Optimization When Utilities are Correlated
- Multivariate Chebyshev Inequalities
- Bounding Distributions for a Stochastic Acyclic Network
- On Cones of Nonnegative Quadratic Functions
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A Conic Programming Approach to Generalized Tchebycheff Inequalities
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- Energy of convex sets, shortest paths, and resistance
- Computational discrete mathematics. Advanced lectures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
