About the Complexity of Two-Stage Stochastic IPs
From MaRDI portal
Publication:5041750
DOI10.1007/978-3-030-45771-6_20zbMath1503.90076arXiv1901.01135OpenAlexW3021408647MaRDI QIDQ5041750
Publication date: 14 October 2022
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.01135
Related Items (6)
Integer programming in parameterized complexity: five miniatures ⋮ Block-structured integer programming: can we parameterize without the largest coefficient? ⋮ Unnamed Item ⋮ The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints ⋮ The double exponential runtime is tight for 2-stage stochastic ILPs ⋮ The double exponential runtime is tight for 2-stage stochastic ILPs
Cites Work
- An integer analogue of Carathéodory's theorem
- Value of the Steinitz constant
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Decomposition of test sets in stochastic integer programming
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Scheduling meets \(n\)-fold integer programming
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
- Finiteness theorems in stochastic integer programming
- Introduction to Stochastic Programming
- On the lengths of bad sequences of monomial ideals over polynomial rings
- Minkowski's Convex Body Theorem and Integer Programming
- Analytical Evaluation of Hierarchical Planning Systems
- On the foundations of linear and integer linear programming I
- Two‐stage stochastic integer programming: a survey
- Faster Algorithms for Integer Programs with Block Structure
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: About the Complexity of Two-Stage Stochastic IPs