scientific article; zbMATH DE number 3634015
zbMath0407.90058MaRDI QIDQ4194733
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BoundsSurveyCombinatorial OptimizationChromatic NumberNp-CompleteSet CoverHeuristic AlgorithmsClique ProblemNp-HardNetwork Design ProblemComparison of AlgorithmsSet PackingAlgorithmic PerformanceDirected and Undirected Hamiltonian CircuitExact CoverGood SolutionsSequencing ProblemSteiner Network ProblemVortex Covering
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Applications of graph theory to circuits and networks (94C15)
Related Items