On the complexity of integer programming-Reference-Cited by-同舟云学术

On the complexity of integer programming

Published:1981-10 Issue:4 Volume:28 Page:765-768
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Papadimitriou Christos H.¹

Affiliation:

1. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, Massachusetts and National Technical University, Athens, Greece

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference8 articles.

1. on posmve integral sohuons to hnear Dlophantlne equauons;BOROSH;Proc Amer Math Soc,1976

2. COOK S A Private communication 1978 COOK S A Private communication 1978

3. DANTZIG G B Linear Programmmg and Extenswns Princeton Umverslty Press Princeton N J 1962 DANTZIG G B Linear Programmmg and Extenswns Princeton Umverslty Press Princeton N J 1962

4. GAREY M.R AND JOHNSON D S 'Strong" NP-completeness results mouvatlon examples and implicatlons ~ ACM 25 3 (July 1978) 499-508. 10.1145/322077.322090 GAREY M.R AND JOHNSON D S 'Strong" NP-completeness results mouvatlon examples and implicatlons ~ ACM 25 3 (July 1978) 499-508. 10.1145/322077.322090

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

1. Robust ordinal regression for subsets comparisons with interactions;European Journal of Operational Research;2025-01

2. Neural quantile optimization for edge–cloud networking;Computer Networks;2024-11

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

4. On two-variable guarded fragment logic with expressive local Presburger constraints;Logical Methods in Computer Science;2024-08-27

5. Sparse Integer Programming Is Fixed-Parameter Tractable;Mathematics of Operations Research;2024-08-19