Sparsity of integer formulations for binary programs
Year of publication: |
2019
|
---|---|
Authors: | Hojny, Christopher ; Lüthen, Hendrik ; Pfetsch, Marc E. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 47.2019, 5, p. 348-352
|
Subject: | IP formulation | Sparsity | Separation complexity | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Fast best subset selection : coordinate descent and local combinatorial optimization algorithms
Hazimeh, Hussein, (2020)
-
Decision support system of truck routing and refueling : a dual-objective approach
Suzuki, Yoshinori, (2013)
-
Adapted water wave optimization for integrated bank customer service representative scheduling
Lu, Xueqin, (2023)
- More ...
-
Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
Burgard, Jan Pablo, (2023)
-
Integer programming models for round robin tournaments
Doornmalen, Jasper van, (2023)
-
Polynomial size IP formulations of knapsack may require exponentially large coefficients
Hojny, Christopher, (2020)
- More ...