The following pages link to Ottimizzazione Combinatoria (Q3579820):
Displaying 18 items.
- Safe set problem on graphs (Q323046) (← links)
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- On the connected safe number of some classes of graphs (Q2051722) (← links)
- Two-stage robust optimization problems with two-stage uncertainty (Q2140314) (← links)
- Two-stage stochastic max-weight independent set problems (Q2149870) (← links)
- The optimality of upgrade pricing (Q2152102) (← links)
- Minimum hitting set of interval bundles problem: computational complexity and approximability (Q2161003) (← links)
- (Q2882852) (← links)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)
- A practitioner’s guide to quantum algorithms for optimisation problems (Q6063352) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- Stackelberg strategies on epidemic containment games (Q6535824) (← links)
- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data (Q6555144) (← links)
- Lower bounds of functions on finite abelian groups (Q6591628) (← links)
- A Graphical Multi-Fidelity Gaussian Process Model, with Application to Emulation of Heavy-Ion Collisions (Q6631205) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
