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
-
A geometric approach to the price of anarchy in nonatomic congestion games
Correa, José R., (2008)
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2003)
-
On-line scheduling to minimize average completion time revisited
Megow, Nicole, (2004)
- More ...