scientific article; zbMATH DE number 3634015

MaRDI QIDQ4194733zbMATH OpenFDO

Authors Francesco Maffioli

Publication date 1979

zbMATH Keywords

Algorithmic PerformanceBoundsChromatic NumberClique ProblemCombinatorial OptimizationComparison of AlgorithmsDirected and Undirected Hamiltonian CircuitExact CoverGood SolutionsHeuristic AlgorithmsNetwork Design ProblemNp-CompleteNp-HardSequencing ProblemSet CoverSet PackingSteiner Network ProblemSurveyVortex Covering

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Applications of graph theory to circuits and networks (94C15)

Cited in

(1)

• Scheduling with neural networks -- the case of the Hubble Space Telescope

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 Q4194733)