Improved integer programming bounds using intersections of corner polyhedra-Reference-Cited by-同舟云学术

Improved integer programming bounds using intersections of corner polyhedra

Published:1975-12 Issue:1 Volume:8 Page:345-368
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Bell David E.,Fisher Marshall L.

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference10 articles.

1. H.P. Crowder and E.L. Johnson, “Use of cyclic group methods in branch and bound”, Mathematical Sciences Department, IBM Watson Research Center, Yorktown Heights, New York (November, 1972).

2. M.L. Fisher and J.F. Shapiro, “Constructive duality in integer programming”,SIAM Journal of Applied Mathematics 27 (1974) 31–52.

3. M.L. Fisher, W.D. Northrup and J.F. Shapiro, “Using duality to solve discrete optimization problems: theory and computational experience”,Mathematical Programming, to appear.

4. R.S. Garfinkel and G.L. Nemhauser,Integer programming (Wiley, New York, 1972).

5. R.E. Gomory, “Some polyhedra related to combinatorial problems”,Linear Algebra and Its Applications 2 (1969) 451–558.

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

1. Two-halfspace closure;Mathematical Programming;2022-03-28

2. References;Integer and Combinatorial Optimization;2014-08-22

3. Symmetric duality for disjunctive programming with absolute value functionals;European Journal of Operational Research;1987-07

4. Symmetric duality for disjunctive programming with absolute value functionals;European Journal of Operational Research;1986-08

5. A Convergent Duality Theory for Integer Programming;Operations Research;1977-06