A completely positive representation of 0-1 linear programs with joint probabilistic constraints
| Year of publication: |
2013
|
|---|---|
| Authors: | Cheng, Jianqiang ; Lisser, Abdel |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 597-601
|
| Subject: | Stochastic programming | Joint probabilistic constraints | 0-1 linear program | Completely positive problems | Semidefinite programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Stochastischer Prozess | Stochastic process | Wahrscheinlichkeitsrechnung | Probability theory |
-
Second order conic approximation for disassembly line design with joint probabilistic constraints
Bentaha, Mohand Lounes, (2015)
-
Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints
Silva, Marco Aurelio Costa da, (2023)
-
Bounds for probabilistic programming with application to a blend planning problem
Peng, Shen, (2022)
- More ...
-
Random-payoff two-person zero-sum game with joint chance constraints
Cheng, Jianqiang, (2016)
-
New reformulations of distributionally robust shortest path problem
Cheng, Jianqiang, (2016)
-
Notoriously hard (mixed-)binary QPs : empirical evidence on new completely positive approaches
Bomze, Immanuel M., (2019)
- More ...