Ottimizzazione Combinatoria
DOI10.1007/978-88-470-1523-4zbMATH Open1207.90002OpenAlexW4250040574MaRDI QIDQ3579820FDOQ3579820
Authors: 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
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (27)
- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
- A Graphical Multi-Fidelity Gaussian Process Model, with Application to Emulation of Heavy-Ion Collisions
- Combinatorial optimization problems in planning and decision making. Theory and applications
- Combinatorial optimization. Theory and applications.
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Lower bounds of functions on finite abelian groups
- Title not available (Why is that?)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- The optimality of upgrade pricing
- Title not available (Why is that?)
- On the connected safe number of some classes of graphs
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality
- Optimization of an SMD placement machine and flows in parametric networks
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- A practitioner’s guide to quantum algorithms for optimisation problems
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Combinatorial optimization. Theory and algorithms. Translated from the 6th English edition by Ulrich Brenner and Rabe von Randow
- Safe set problem on graphs
- Minimum hitting set of interval bundles problem: computational complexity and approximability
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Combinatorial optimization. Theory and algorithms.
- Title not available (Why is that?)
- Stackelberg strategies on epidemic containment games
- Two-stage stochastic max-weight independent set problems
- Two-stage robust optimization problems with two-stage uncertainty
- Maximization of \(k\)-submodular function with a matroid constraint
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Ottimizzazione Combinatoria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579820)
