No label defined (Q3220091)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3887435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3887435 |
Statements
1984
0 references
Bibliography
0 references
Grötschel, Martin
0 references
combinatorial optimization
0 references
Polynomial time solvability
0 references
NP-completeness
0 references
Polyhedral combinatorics
0 references
cutting planes
0 references
0.8531562685966492
0 references
0.8425288796424866
0 references
0.8422240018844604
0 references
0.8422240018844604
0 references
[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.
0 references