Computer Codes for Problems of Integer Programming-Reference-Cited by-同舟云学术

Computer Codes for Problems of Integer Programming

Published:1979 Issue: Volume: Page:221-269
ISSN:0167-5060
Container-title:Discrete Optimization II, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver
language:
Short-container-title:

Author:

Land A.,Powell S.

Publisher

Elsevier

Reference58 articles.

1. An additive algorithm for solving linear programs with zero-one variables;Balas;Operations Res.,1965

2. Global optimization using special ordered sets;Beale;Math. Programming,1976

3. E.M.L. Beale and J.A. Tomlin, Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables, in: J. Lawrence, ed., Proceedings of the Fifth International Conference on O.R. (Tavistock Publications, London, 1970) 447–454

4. A convergent duality theory for Integer Programming;Bell;Operations Res.,1977

5. Experiments in mixed-integer linear programming;Benichou;Math. Programming,1971

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

1. A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints;European Journal of Operational Research;2022-10

2. Rail platooning: Scheduling trains along a rail corridor with rapid-shunting facilities;European Journal of Operational Research;2021-10

3. Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference;International Journal of Computer Vision;2015-10-24

4. Integer Programming;Wiley StatsRef: Statistics Reference Online;2014-09-29

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