_version_ |
1811069140664844288
|
author2 |
Bertsimas, Dimitris J.
|
author_facet |
Bertsimas, Dimitris J.
|
collection |
MIT
|
description |
Includes bibliographical references (p. 26-27).
|
first_indexed |
2024-09-23T08:06:21Z
|
id |
mit-1721.1/5095
|
institution |
Massachusetts Institute of Technology
|
language |
eng
|
last_indexed |
2024-09-23T08:06:21Z
|
publishDate |
2004
|
publisher |
Massachusetts Institute of Technology, Operations Research Center
|
record_format |
dspace
|
spelling |
mit-1721.1/50952019-04-09T16:40:13Z From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems Bertsimas, Dimitris J. Teo, Chungpiaw Includes bibliographical references (p. 26-27). Supported by a Presidential Young Investigator Award. DDM-9158118 Partially supported by Draper Laboratory and the National University of Singapore. Dimitris Bertsimas, Chung-Piaw Teo. 2004-05-28T19:22:55Z 2004-05-28T19:22:55Z 1994 http://hdl.handle.net/1721.1/5095 eng Operations Research Center Working Paper;OR 294-94 27 p. 1529738 bytes application/pdf application/pdf Massachusetts Institute of Technology, Operations Research Center
|
spellingShingle |
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
|
title |
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
|
title_full |
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
|
title_fullStr |
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
|
title_full_unstemmed |
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
|
title_short |
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
|
title_sort |
from valid inequalities to heuristics a unified view of primal dual approximation algortithms sic in covering problems
|
url |
http://hdl.handle.net/1721.1/5095
|