scientific article; zbMATH DE number 3898612

MaRDI QIDQ3677508zbMATH OpenFDO

Authors Martin Grötschel

Publication date 1984

zbMATH Keywords

combinatorial optimizationdesign of LP-based cutting plane algorithmslinear orderingmax cut problemspolyhedral combinatoricstravelling salesman

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4112391
• scientific article; zbMATH DE number 3904331
• scientific article; zbMATH DE number 863499
• scientific article; zbMATH DE number 24443
• scientific article; zbMATH DE number 3887434
• scientific article; zbMATH DE number 4187465
• Polyhedra and polytopes: algebra and combinatorics
• On the facets of combinatorial polytopes
• Polyhedral Combinatorics in Combinatorial Optimization

Cited in

(9)

• Cutting planes in combinatorics
• Optimization by hierarchical mutant production
• Scaling features in complex optimization problems
• scientific article; zbMATH DE number 3887434 (Why is no real title available?)
• Polyhedral Combinatorics in Combinatorial Optimization
• scientific article; zbMATH DE number 4093179 (Why is no real title available?)
• scientific article; zbMATH DE number 219017 (Why is no real title available?)
• scientific article; zbMATH DE number 4187465 (Why is no real title available?)
• The landscape of the traveling salesman 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 Q3677508)