Solving sparse separable bilinear programs using lifted bilinear cover inequalities
Year of publication: |
2024
|
---|---|
Authors: | Gu, Xiaoyi ; Dey, Santanu S. ; Richard, Jean-Philippe P. |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 36.2024, 3, p. 884-899
|
Subject: | lifting | nonconvex | separable bilinear sets | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Single-car routing in rail freight transport
Fügenschuh, Armin, (2015)
-
Risk-averse shortest path interdiction
Song, Yongjia, (2016)
-
Lifting of probabilistic cover inequalities
Joung, Seulgi, (2017)
- More ...
-
Facets of two-dimensional infinite group problems
DEY, Santanu S.,
-
Facets of two-dimensional infinite group problems
DEY, Santanu S.,
-
Facets of Two-Dimensional Infinite Group Problems
Dey, Santanu S., (2008)
- More ...