2021
DOI: 10.1007/s10107-021-01698-z
|View full text |Cite
|
Sign up to set email alerts
|

About the complexity of two-stage stochastic IPs

Abstract: We consider so called 2-stage stochastic integer programs (IPs) and their generalized form, so called multi-stage stochastic IPs. A 2-stage stochastic IP is an integer program of the form $$\max \{ c^T x \mid {\mathcal {A}} x = b, \,l \le x \le u,\, x \in {\mathbb {Z}}^{s + nt} \}$$ max { c T x ∣ A x … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 25 publications
0
1
0
Order By: Relevance
“…Specifically, they considered the setting where A has few rows and then used the Steinitz Lemma to obtain an algorithm with running time (m∆) O(m 2 ) • n, where ∆ is the maximum absolute value in A. This has inspired a line of work for similar settings, see for example [6,9,3,8]. Our setting is a generalization of theirs: take A = W and let…”
Section: Applicationsmentioning
confidence: 99%
“…Specifically, they considered the setting where A has few rows and then used the Steinitz Lemma to obtain an algorithm with running time (m∆) O(m 2 ) • n, where ∆ is the maximum absolute value in A. This has inspired a line of work for similar settings, see for example [6,9,3,8]. Our setting is a generalization of theirs: take A = W and let…”
Section: Applicationsmentioning
confidence: 99%