A simple finite cutting plane algorithm for integer programs-Reference-Cited by-同舟云学术

A simple finite cutting plane algorithm for integer programs

Published:2012-11 Issue:6 Volume:40 Page:578-580
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Neto José

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference7 articles.

1. Page cuts for integer interval linear programming;Amstrong;Discrete Applied Mathematics,1979

2. D.E. Bell, A cutting plane algorithm for integer programs with an easy proof of convergence, WP-73-15, International Institute for Applied Systems Analysis, Laxenburg, 1973.

3. A finiteness proof for modified Dantzig cuts in integer programming;Bowman;Naval Research Logistics Quarterly,1970

4. Outline of an algorithm for integer solutions to linear programs;Gomory;Bulletin of the American Mathematical Society,1958

5. An Algorithm for the Mixed Integer Problem, RM-2597;Gomory,1960

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

1. Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective;4OR;2020-12-23

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

3. A Two-Phase Combined Gradient-Tunneling Based Algorithm for Constrained Integer Programming Problems;Journal of Information and Optimization Sciences;2015-06-09

4. Pure Cutting-Plane Algorithms and their Convergence;Wiley Encyclopedia of Operations Research and Management Science;2013-10-15