Expressing combinatorial optimization problems by Linear Programs

This publication has 21 references indexed in Scilit:

• Vertex packing algorithms
  Published by Springer Nature ,2005
• Some simplified NP-complete graph problems
  Published by Elsevier ,2002
• Using separation algorithms to generate mixed integer model reformulations
  Operations Research Letters, 1991
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
  Operations Research Letters, 1987
• Lower bounds on monotone complexity of the logical permanent
  Mathematical Notes, 1985
• The complexity of facets (and some facets of complexity)
  Journal of Computer and System Sciences, 1984
• The perfectly matchable subgraph polytope of a bipartite graph
  Networks, 1983
• Linear programming is log-space hard for P
  Information Processing Letters, 1979
• On defining sets of vertices of the hypercube by linear inequalities
  Discrete Mathematics, 1975
• Maximum matching and a polyhedron with 0,1-vertices
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965