Approximate formulations for 0-1 knapsack sets
Year of publication: |
2008
|
---|---|
Authors: | Bienstock, Daniel |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 36.2008, 3, p. 317-320
|
Subject: | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | USA | United States | Theorie | Theory |
-
A cycle-based fomulation and valid inequalities for DC power transmission problems with switching
Kocuk, Burak, (2016)
-
The maximum-impact coloring polytope
Braga, Mónica, (2017)
-
The Cunningham-Geelen method in practice : branch-decompositions and integer programming
Margulies, S., (2013)
- More ...
-
Minimum cost capacity installation for multicommodity network flows
BIENSTOCK, Daniel,
-
U.S./India co-operative biomass conversion program
Talib, Abu, (1986)
-
U.S./India co-operative coal conversion program
Kulkarni, A., (1986)
- More ...