# Computing in Combinatorial Optimization

@inproceedings{Cook2019ComputingIC, title={Computing in Combinatorial Optimization}, author={W. Cook}, booktitle={Computing and Software Science}, year={2019} }

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.

#### Topics from this paper

#### 4 Citations

Computation and Complexity

- Computer Science
- Computing and Software Science
- 2019

The following summary presents short descriptions of the twelve chapters in this topical part of Theoretical Computer Science. Expand

Research trends in combinatorial optimization

- Computer Science, Economics
- 2020

The demonstration of global research trends in CO can support researchers in identifying the relevant issues regarding this expanding and transforming research area. Expand

A Landscape-based Analysis of Fixed Temperature and Simulated Annealing

- 2021

Since the introduction of Simulated Annealing (SA), researchers have considered variants that keep the same temperature value throughout the whole search and tried to determine whether this strategy… Expand

#### References

SHOWING 1-10 OF 71 REFERENCES

Combinatorial Optimization: Theory and Algorithms

- Computer Science
- 2007

This fourth edition of this comprehensive textbook on combinatorial optimization is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Expand

The Design of Approximation Algorithms

- Computer Science, Mathematics
- 2011

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions to discrete optimization problems. Expand

Approximation Algorithms

- Computer Science
- Springer Berlin Heidelberg
- 2003

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement… Expand

Exact Algorithms for NP-Hard Problems: A Survey

- Computer Science, Mathematics
- Combinatorial Optimization
- 2001

This paper discusses fast exponential time solutions for NP-complete problems, which includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more. Expand

An overview of computational complexity

- Mathematics, Computer Science
- CACM
- 1983

An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower… Expand

Optimization by Simulated Annealing

- Medicine, Computer Science
- Science
- 1983

A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems. Expand

Reducibility Among Combinatorial Problems

- Computer Science
- 50 Years of Integer Programming
- 2010

Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability. Expand

Solution of large-scale symmetric travelling salesman problems

- Mathematics, Computer Science
- Math. Program.
- 1991

The implementation is based on a fast LP-solver (IBM's MPSX) and makes effective use of polyhedral results on the symmetric travelling salesman polytope and describes the important ingredients of the code. Expand

George Dantzig's contributions to integer programming

- Mathematics, Computer Science
- Discret. Optim.
- 2008

This paper reviews George Dantzig's contributions to integer programming, especially his seminal work with Fulkerson and Johnson on the traveling salesman problem.

An efficient heuristic procedure for partitioning graphs

- Mathematics, Computer Science
- Bell Syst. Tech. J.
- 1970

A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented. Expand