Properties of vertex packing and independence system polyhedra-Reference-Cited by-同舟云学术

Properties of vertex packing and independence system polyhedra

Published:1974-12 Issue:1 Volume:6 Page:48-61
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Nemhauser G. L.,Trotter L. E.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference15 articles.

1. M.L. Balinski, “Integer programming: Methods, uses, computation”,Management Science 12 (1965) 253–313.

2. M.L. Balinski, “Establishing the matching polytope”,Journal of Combinatorial Theory 13 (1972) 1–13.

3. M.L. Balinski and K. Spielberg, “Methods of integer programming: Algebraic, combinatorial and enumerative”, in:Progress in operations research, Vol. III, Ed. J. Aronofsky (Wiley, New York, 1969) pp. 195–292.

4. V. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques-238, Université de Montréal (October 1972).

5. J. Edmonds, “Covers and packings in a family of sets”,Bulletin of the American Mathematical Society 68 (1962) 494–499.

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

1. Stable set reformulations for the degree preserving spanning tree problem;European Journal of Operational Research;2024-11

2. Some new clique inequalities in four-index hub location models;European Journal of Operational Research;2024-11

3. Integer programs with bounded subdeterminants and two nonzeros per row;Journal of the ACM;2024-09-13

4. Maximizing Engagement in Large-Scale Social Networks;INFORMS Journal on Optimization;2024-08-05

5. Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing;Journal of the Physical Society of Japan;2024-03-15