The Complexity of Generic Primal Algorithms for Solving General Integer Programs
Year of publication: |
2002
|
---|---|
Authors: | Schulz, Andreas S. ; Weismantel, Robert |
Published in: |
Mathematics of operations research. - Linthicum, Md : Inst, ISSN 0364-765X, ZDB-ID 1956838. - Vol. 27.2002, 4, p. 681-692
|
Saved in:
Saved in favorites
Similar items by person
-
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
Dunkel, Juliane, (2008)
-
Meyers, Carol A., (2009)
-
Encouraging cooperation in sharing supermodular costs
Schulz, Andreas S., (2007)
- More ...