scientific article; zbMATH DE number 3887435
[For the entire collection see Zbl 0548.00010.] This paper describes developments in combinatorial optimization in the last thirty years and outlines trends of future research. Section 1 introduces a few representative problems of the subject and mentions some applications. Polynomial time solvability and NP-completeness of combinatorial optimization problems are discussed in Section 2. Polyhedral combinatorics, and the theory and practice of cutting planes are surveyed in detail in Section 3. Many of the landmarks of these topics are mentioned, open problems and future developments are outlined. Section 4 describes some of the relations of combinatorial optimization to other branches of mathematics. In particular, some of the major recent breakthroughs that arose from applying the results of other fields to combinatorial optimization (and vice versa) are mentioned. Moreover, lists of promising research areas and concrete open problems are given.
- Polyhedral results for a vehicle routing problem
- Some thoughts on combinatorial optimisation
- Combinatorial optimization: current successes and directions for the future
- Computing in combinatorial optimization
- New perspectives of several fundamental problems in combinatorial optimization
- Polyhedral approaches
- Polyhedral combinatorics and combinatorial optimization
- scientific article; zbMATH DE number 1031377 (Why is no real title available?)
- scientific article; zbMATH DE number 792643 (Why is no real title available?)
- Advances in combinatorial optimization
- Research trends in combinatorial optimization
- Recent trends in combinatorial optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220091)