Ottimizzazione Combinatoria
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80) Combinatorial optimization (90C27)
Cited in
(29)- Combinatorial optimization. Theory and algorithms. Translated from the 6th English edition by Ulrich Brenner and Rabe von Randow
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Combinatorial optimization problems in planning and decision making. Theory and applications
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality
- On the connected safe number of some classes of graphs
- Two-stage robust optimization problems with two-stage uncertainty
- Two-stage stochastic max-weight independent set problems
- The optimality of upgrade pricing
- Minimum hitting set of interval bundles problem: computational complexity and approximability
- Combinatorial optimization. Theory and applications.
- Optimization of an SMD placement machine and flows in parametric networks
- scientific article; zbMATH DE number 1805583 (Why is no real title available?)
- Safe set problem on graphs
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- scientific article; zbMATH DE number 1157223 (Why is no real title available?)
- 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
- Combinatorial optimization. Theory and algorithms.
- Combinatorial optimization. Theory and algorithms.
- A practitioner’s guide to quantum algorithms for optimisation problems
- Maximization of k-submodular function with a matroid constraint
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Stackelberg strategies on epidemic containment games
- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
- Lower bounds of functions on finite abelian groups
- A Graphical Multi-Fidelity Gaussian Process Model, with Application to Emulation of Heavy-Ion Collisions
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Double interdiction problem on trees on the sum of root-leaf distances by upgrading edges
- Understanding instance hardness for optimisation algorithms: methodologies, open challenges and post-quantum implications
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)
