Book ChapterOPEN ACCESS

Computing in combinatorial optimization

Springer, (2019), 27-47
DOI: 10.1007/978-3-319-91908-9_3
7Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Research in combinatorial optimization successfully combines diverse ideas drawn from computer science, mathematics, and operations research. We give a tour of this work, focusing on the early development of the subject and the central role played by linear programming. The paper concludes with a short wish list of future research directions.

Author supplied keywords

Cite

CITATION STYLE

APA

Cook, W. (2019). Computing in combinatorial optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10000, pp. 27–47). Springer. https://doi.org/10.1007/978-3-319-91908-9_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free