Work

Computational Complexity of Discrete Optimization Problems

Year: 1979

Type: book-chapter

Source: Annals of discrete mathematics

Parent work: Discrete Optimization I, 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

DOI: 10.1016/s0167-5060(08)70821-5

Authors: J.K. Lenstra, A.H.G. Rinnooy Kan

Institution: Erasmus University Rotterdam

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1555410326

FWCI: 20.03

Cites: 44

Cited by: 296

Related to: 9