From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
Includes bibliographical references (p. 26-27).
Other Authors: | Bertsimas, Dimitris |
---|---|
Language: | eng |
Published: |
Alfred P. Sloan School of Management, Massachusetts Institute of Technology
2003
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/2521 |
Similar Items
-
From valid inequalities to heuristics : a unified view of primal-dual approximation algortithms [sic] in covering problems
Published: (2004) -
Restless bandit, linear programming relaxations and a primal-dual heuristic
Published: (2003) -
Equivalence of primal and dual simplex algorithms for the maximum flow problem
Published: (2003) -
Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic
by: Bertsimas, Dimitris J., et al.
Published: (2004) -
A unified framework for primal-dual methods in minimum cost network flow problems
Published: (2003)