scientific article; zbMATH DE number 3887435

zbMATH Open0556.90057MaRDI QIDQ3220091FDOQ3220091

Author name not available (Why is that?)

Publication date: 1984

Title of this publication is not available (Why is that?)

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)

Cited In (5)

• Title not available (Why is that?)
• Combinatorial optimization: current successes and directions for the future
• Research trends in combinatorial optimization
• Advances in combinatorial optimization
• Polyhedral results for a vehicle routing problem

   Recommendations

• Recent trends in combinatorial optimization 👍 👎
• Polyhedral combinatorics and combinatorial optimization 👍 👎
• Polyhedral techniques in combinatorial optimization I: Theory 👍 👎
• Computing in combinatorial optimization 👍 👎
• Title not available (Why is that?) 👍 👎

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)