scientific article

zbMath0588.90062MaRDI QIDQ3716814

Alexander H. G. Rinnooy Kan, Jan Karel Lenstra, Colin J. H. McDiarmid, Richard M. Karp

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

coveringcombinatorial optimizationerror analysisbranch-and-boundprobabilistic analysispackingsimplex methodlocationsearchstable setscoloringsroutingvalue analysisrunning time analysisaverage behaviormatchings in graphsoptimal assignmentsHamiltonian cycles in random graphsshortest traveling salesman tours

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Quadratic programming (90C20) Linear programming (90C05) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Stochastic on-line knapsack problems, On the greedy algorithm with random costs, Parallel graph algorithms that are efficients on average