Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope

DOI10.1016/j.orl.2020.03.003OpenAlexW3015850276MaRDI QIDQ2183218

Yanyan Li

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.03.003

zbMATH Keywords

facetspolyhedral combinatoricsstochastic mixed-integer programming

Mathematics Subject Classification ID

Convex and discrete geometry (52-XX) Operations research, mathematical programming (90-XX)

Uses Software

• PySP

Cites Work

• Unnamed Item
• Automatic formulation of stochastic programs via an algebraic modeling language
• Valid inequalities for mixed 0-1 programs
• Submodularity and valid inequalities in capacitated fixed charge networks
• On the dimension of projected polyhedra
• The complementary class of generalized flow cover inequalities
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A two-stage multi-echelon stochastic blood supply chain problem
• New valid inequalities for the fixed-charge and single-node flow polytopes
• PySP: modeling and solving stochastic programs in Python
• A stochastic programming approach for supply chain network design under uncertainty
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Bi-objective stochastic programming models for determining depot locations in disaster relief operations
• Introduction to Stochastic Programming
• Valid Linear Inequalities for Fixed Charge Problems
• A Dual-Based Procedure for Stochastic Facility Location
• Applications of Stochastic Programming
• Flow pack facets of the single node fixed-charge flow polytope

This page was built for publication: Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope