Combinatorial Optimization: What is the State of the Art

DOI10.1287/moor.5.1.1zbMath0435.90069OpenAlexW2078792071MaRDI QIDQ3875698

Victor Klee

Publication date: 1980

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/20bedb657d666ca1ff94db15a6b6b15afc8c35cd

zbMATH Keywords

computational complexitycombinatorial optimizationBibliographymaximum matchingminimum spanning treemaximum flowminimum pathgood algorithmminimum tour

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations ⋮ Automatic identification of embedded network rows in large-scale optimization models ⋮ A restricted Lagrangean approach to the traveling salesman problem ⋮ Recent trends in combinatorial optimization