scientific article
zbMath0484.90075MaRDI QIDQ3944353
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lagrangean relaxationprobabilistic analysisapproximation schemesheuristic algorithmsbranch and bound algorithmworst-case analysisfacetcomplexity theorypolyhedral combinatoricscutting plane methodsefficiency measuressymmetric travelling salesmanhard combinatorial optimization problemsextensive survey
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Integer programming (90C10) Deterministic network models in operations research (90B10) Enumeration in graph theory (05C30) Paths and cycles (05C38) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
This page was built for publication: