Cutting-plane proofs in polynomial space-Reference-Cited by-同舟云学术

Cutting-plane proofs in polynomial space

Published:1990-05 Issue:1-3 Volume:47 Page:11-18
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Cook William

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01580849.pdf

Reference23 articles.

1. L. Babai, “On Lovász' lattice recudtion nad the nearest lattice point problem,”Combinatorica 6 (1986) 1–13.

2. S.C. Boyd and W.R. Pulleyblank, “Facet generating techniques,” in preparation.

3. V. Chvátal, “Edmonds polytopes and a hierarchy of combinatorial problems,”Discrete Mathematics 4 (1973) 305–337.

4. V. Chvátal, “Edmonds polytopes and weakly hamiltonian graphs,”Mathematical Programming 5 (1973) 29–40.

5. V. Chvátal, “Cutting-plane proofs and the stability number of a graph,” Report Number 84326-OR, Institut für Ökonometrie und Operations Research, Universität Bonn (Bonn, 1984).

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal length cutting plane refutations of integer programs;Discrete Optimization;2023-11

2. Optimal Length Cutting Plane Refutations of Integer Programs;Algorithms and Discrete Applied Mathematics;2023

3. Theoretical challenges towards cutting-plane selection;Mathematical Programming;2018-05-29

4. The Space Complexity of Cutting Planes Refutations;LEIBNIZ INT PR INFOR;2015

5. Pebble Games, Proof Complexity, and Time-Space Trade-offs;Logical Methods in Computer Science;2013-09-13