scientific article; zbMATH DE number 3887435

MaRDI QIDQ3220091zbMATH OpenFDO

Authors

Publication date 1984

zbMATH Keywords

combinatorial optimizationcutting planesNP-completenessBibliographyPolyhedral combinatoricsGrötschel, MartinPolynomial time solvability

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Recommendations

• Recent trends in combinatorial optimization
• Polyhedral combinatorics and combinatorial optimization
• Polyhedral techniques in combinatorial optimization I: Theory
• Computing in combinatorial optimization
• scientific article; zbMATH DE number 4187465

Cited in

(10)

• New perspectives of several fundamental problems in combinatorial optimization
• Research trends in combinatorial optimization
• Polyhedral approaches
• scientific article; zbMATH DE number 792643 (Why is no real title available?)
• Polyhedral combinatorics and combinatorial optimization
• Computing in combinatorial optimization
• Combinatorial optimization: current successes and directions for the future
• Recent trends in combinatorial optimization
• Advances in combinatorial optimization
• Polyhedral results for a vehicle routing problem

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)