Combinatorial Optimization: What is the State of the Art

DOI10.1287/MOOR.5.1.1zbMATH Open0435.90069OpenAlexW2078792071MaRDI QIDQ3875698FDOQ3875698

Authors: 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 optimizationminimum spanning treemaximum flowmaximum matchingminimum pathBibliographygood algorithmminimum tour

Mathematics Subject Classification ID

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

Cited In (4)

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

This page was built for publication: Combinatorial Optimization: What is the State of the Art

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3875698)