scientific article; zbMATH DE number 3761787

MaRDI QIDQ3944353zbMATH OpenFDO

Authors Martin Grötschel

Publication date 1982

zbMATH Keywords

approximation schemesbranch and bound algorithmcomplexity theorycutting plane methodsefficiency measuresextensive surveyfacethard combinatorial optimization problemsheuristic algorithmsLagrangean relaxationpolyhedral combinatoricsprobabilistic analysissymmetric travelling salesmanworst-case analysis

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(2)

• Euclidean semi-matchings of random samples
• A heuristic lagrangean algorithm for the capacitated plant location 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 Q3944353)