Ottimizzazione Combinatoria

DOI10.1007/978-88-470-1523-4zbMath1207.90002OpenAlexW4250040574MaRDI QIDQ3579820

Bernhard Korte, Jens Vygen

Publication date: 11 August 2010

Published in: UNITEXT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-88-470-1523-4

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (14)

Two-stage robust optimization problems with two-stage uncertainty ⋮ Safe set problem on graphs ⋮ Two-stage stochastic max-weight independent set problems ⋮ The optimality of upgrade pricing ⋮ Minimum hitting set of interval bundles problem: computational complexity and approximability ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ A practitioner’s guide to quantum algorithms for optimisation problems ⋮ Maximization of \(k\)-submodular function with a matroid constraint ⋮ Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems ⋮ A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality ⋮ Unnamed Item ⋮ On the connected safe number of some classes of graphs ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Statistical mechanics analysis of generalized multi-dimensional knapsack problems

This page was built for publication: Ottimizzazione Combinatoria