|
810
|
Geometric Algorithms and Combinatorial Optimization
– Grotschel, Lovasz, et al.
- 1993
|
|
536
|
A course in computational algebraic number theory
– Cohen
- 1997
|
|
511
|
The complexity of theorem-proving procedures
– COOK
|
|
290
|
Gröbner bases: an algorithmic method in polynomial ideal theory
– Buchberger
- 1985
|
|
236
|
Gröbner Bases, A Computational Approach to Commutative Algebra
– Becker, Weispfenning
- 1992
|
|
121
|
Varieties and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra
– Cox, little, et al.
- 1991
|
|
67
|
Combinatorial Convexity and Algebraic Geometry
– Ewald
- 1996
|
|
64
|
A min-max relation for submodular functions on graphs
– Edmonds, Giles
- 1977
|
|
57
|
Polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed
– Barvinok
- 1994
|
|
54
|
An improved low-density subset sum algorithm
– Coster, LaMacchia, et al.
|
|
49
|
Scaling algorithms for network problems
– Gabow
- 1985
|
|
44
|
Buchberger algorithm and integer programming
– Conti, Traverso
|
|
42
|
Lattice reduction: A toolbox for the cryptanalyst
– Joux, Stern
- 1998
|
|
36
|
Some polyhedra related to combinatorial problems
– Gomory
- 1969
|
|
33
|
On the foundation of linear and integer programming I
– Graver
- 1975
|
|
23
|
Decomposition of integer programs and of generating sets
– Cornuéjols, Urbaniak, et al.
- 1997
|
|
21
|
An implementation of the generalized basis reduction algorithm for integer programming
– Cook, Rutherford, et al.
- 1993
|
|
20
|
An integer analogue of Caratheodory’s theorem
– COOK, FONLUPT, et al.
- 1986
|
|
18
|
Network Theory, algorithms, and applications
– Ahuja, Magnanti, et al.
- 1993
|
|
18
|
Some continuous functions related to corner polyhedra ii
– Gomory, Johnson
- 1972
|
|
17
|
Theoretical improvements in algorithmic eciency for network problems
– Edmonds, Karp
- 1972
|
|
16
|
A Class of Hard Small 0-1 Programs
– Cornuejols, Dawande
- 1999
|
|
15
|
A counterexample to an integer analogue of Carathéodory’s theorem
– Bruns, Gubeladze, et al.
- 1999
|
|
15
|
Total dual integrality and integer polyhedra
– Giles, Pulleyblank
- 1979
|
|
15
|
On the relation between integer and noninteger solutions to linear programs
– Gomory
- 1965
|
|
14
|
Hilbert bases, unimodular triangulations, and binary covers of rational polyhedral cones
– Firla, Ziegler
- 1999
|
|
13
|
Market split and basis reduction: Towards a solution of the Cornuejols-Dawande instances
– Aardal, Bixby, et al.
- 1999
|
|
13
|
On barvinok’s algorithm for counting lattice points in fixed dimension
– Dyer, Kanna
- 1997
|
|
13
|
The Ellipsoid Method and Combinatorial Optimization
– Grötschel, Lovasz, et al.
- 1988
|
|
13
|
Standard pairs and group relaxations in integer programming
– Ho¸sten, Thomas
- 1999
|
|
12
|
Solving a system of diophantine equations with lower and upper bounds on the variables
– Aardal, Hurkens, et al.
- 1998
|
|
10
|
Solving a linear diophantine equation with lower and upper bounds on the variables
– Aardal, Hurkens, et al.
- 1998
|
|
10
|
A polynomial-time algorithm for the knapsack problem with two variables
– Hirschberg, Wong
- 1976
|
|
9
|
On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities
– Dais, Haus, et al.
- 1998
|
|
8
|
Sections euclidiennes et volume des corps symetriques convexes dans
– Bourgain, Milman
- 1985
|
|
7
|
Computational experience with a group theoretic integer programming algorithm
– Gorry, Northup, et al.
- 1973
|
|
6
|
Faces of an integer polyhedron
– Gomory
- 1967
|
|
5
|
A convergent duality theory for integer programming
– Bell, Shapiro
- 1977
|
|
5
|
Integer Programming { Facets, Subadditivity and Duality for Group and SemiGroup Problems
– Johnson
- 1980
|
|
4
|
Sensitivity theorems in integer programming problems
– Cook, Gerards, et al.
- 1986
|
|
4
|
Variable metric relaxation methods, Part II: The ellipsoid method
– Gon
- 1984
|
|
4
|
The height of minimal Hilbert bases
– Henk, Weismantel
- 1997
|
|
4
|
Hilbert bases of cones related to simultaneous Diophantine approximations and linear Diophantine equations, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, Preprint SC
– Henk, Weismantel
- 1997
|
|
4
|
A theorem about minimal solutions of linear Diophantine equations, Contributions to Algebra and Geometry
– Henk, Weismantel
- 1998
|
|
3
|
Treybig (1976), Bounds on positive integral solutions of linear diophantine equations
– Borosh, B
|
|
3
|
Normality and covering properties, preprint, University of Osnabr uck
– Bruns, Gubeladze
- 1998
|
|
3
|
Gubeladze and N.V. Trung
– Bruns, J
- 1997
|
|
3
|
der Corput (1931), Uber Systeme von linear-homogenen Gleichungen und Ungleichungen
– van
|
|
3
|
1873), Uber die Au linearer Gleichungen mit reellen
– Gordan
|
|
3
|
Hermite (1850), Extraits de lettres de M. Ch. Hermite a M. Jacobii sur dierents objets de la theorie des nombres. Journal fur die reine und angewandte Mathematik 40
– Ch
- 1905
|
|
