Combinatorial Linear Programming: Geometry Can Help

This publication has 13 references indexed in Scilit:

• Deformed products and maximal shadows of polytopes
  Published by American Mathematical Society (AMS) ,1999
• A subexponential bound for linear programming
  Algorithmica, 1996
• Rectilinear and polygonal p-piercing and p-center problems
  Published by Association for Computing Machinery (ACM) ,1996
• A Subexponential Algorithm for Abstract Optimization Problems
  SIAM Journal on Computing, 1995
• A short proof of the d-connectedness of d-polytypes
  Discrete Mathematics, 1995
• Lower bounds for a subexponential optimization algorithm
  Random Structures & Algorithms, 1994
• Completely unimodal numberings of a simple polytope
  Discrete Applied Mathematics, 1988
• Polynomial algorithms in linear programming
  USSR Computational Mathematics and Mathematical Physics, 1980
• New Finite Pivoting Rules for the Simplex Method
  Mathematics of Operations Research, 1977
• Long Monotone Paths in Abstract Polytopes
  Mathematics of Operations Research, 1976