Andreas S. Schulz, Robert Weismantel  Home/Search
Context
Related
| mit.edu/schulz/www/sw.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/schulz/www...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Primal methods constitute a common approach to solving (combinatorial) optimization problems. (Update)
Similar documents (at the sentence level):
21.7%: The Complexity of Generic Primal Algorithms for Solving.. - Schulz, Weismantel (1999) (Correct)
Active bibliography (related documents): More All
0.8: Minimum Ratio Canceling is Oracle Polynomial for Linear.. - McCormick, SHIOURA (1999) (Correct)
0.6: Non-Standard Approaches to Integer Programming - Aardal, Weismantel, Wolsey (1999) (Correct)
0.6: Complexity of Primal Methods in Integer Programming - Schulz, Weismantel (1998) (Correct)
Similar documents based on text: More All
0.7: 0/1-Integer Programming: Optimization and Augmentation.. - Schulz, Weismantel.. (1995) (Correct)
0.6: A Primal Analogue of Cutting Plane Algorithms - Firla, Spille, Weismantel (1999) (Correct)
0.4: Integer Pivoting Revisited - Firla, Haus, Köppe, Spille.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ schulz-complexity,
author = "Andreas S. Schulz and Robert Weismantel",
title = "The Complexity of Generic Primal Algorithms for Solving General Integer
Programs",
url = "citeseer.ist.psu.edu/496422.html" }
Citations (may not include all citations):370 Network Flows: Theory (context) - Ahuja, Magnanti et al. - 1993
102 A characterization of the minimum cycle mean in a digraph (context) - Karp - 1978
68 Theoretical improvements in algorithmic efficiency for netwo.. (context) - Edmonds, Karp - 1972
43 A geometric Buchberger algorithm for integer programming - Thomas - 1995
32 Variation of cost functions in integer programming - Sturmfels, Thomas - 1997
27 Algorithms and Combinatorics (context) - Grotschel, Lovasz et al. - 1988
21 integer programming: Optimization and augmentation are equiv.. - Schulz, Weismantel et al. - 1995
15 New scaling algorithms for the assignment and minimum cycle .. (context) - Orlin, Ahuja - 1992
11 A polynomial combinatorial algorithm for generalized minimum.. - Wayne - 1999
11 Decomposition of integer programs and of generating sets (context) - Cornuejols, Urbaniak et al. - 1997
11 The Hirsch conjecture is true (context) - Naddef - 1989
11 GRIN: An implementation of Gr obner bases for integer progra.. (context) - Hosten, Sturmfels - 1995
9 Relaxed most negative cycle and most positive cut canceling .. (context) - Shigeno, Iwata et al. - 1997
8 Finding minimum-cost circulations by cancelling negative cyc.. (context) - Goldberg, Tarjan - 1989
7 Combinatorial optimization (context) - Grotschel, Lovasz - 1995
6 An oracle--polynomial time augmentation algorithm for intege.. (context) - Schulz, Weismantel - 1999
6 A minimum ratio cycle canceling algorithm for linear program.. (context) - McCormick, Shioura - 1996
6 A combinatorial interior point method for network flow probl.. (context) - Wallacher, Zimmermann - 1992
6 A variant of the Buchberger algorithm for integer programmin.. (context) - Urbaniak, Weismantel et al. - 1997
4 Contributions to Algebra and Geometry (context) - Sturmfels, Weismantel et al. - 1995
2 An oracle--polynomial primal augmentation algorithm for mixe.. (context) - McCormick, Schulz et al. - 2000
2 Mean canceling algorithms for general linear programs (context) - McCormick, Ervolina et al. - 1994
2 ur Fluprobleme und submodulare Fluprobleme (context) - Wallacher, Algorithmen - 1992
2 New polynomial-time cycle-canceling algorithms for minimum-c.. - Sokkalingam, Ahuja et al. - 2000
1 Test sets and inequalities for integer programs (context) - Thomas, Weismantel - 1996
1 Algebraic Algorithms and Error--Correcting Codes (context) - Conti, Traverso et al. - 1991
1 an extended abstract appeared in the Proceedings of the 11th.. (context) - canceling, polynomial et al. - 2000
Documents on the same site (http://web.mit.edu/schulz/www/publications.html): More
ε-Optimization Schemes and L-Bit Precision.. - Orlin, Schulz, Sengupta (2000) (Correct)
The Power of alpha-Points in Preemptive Single Machine.. - Schulz, Skutella (2000) (Correct)
The Complexity of Generic Primal Algorithms for Solving.. - Schulz, Weismantel (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC