The following pages link to Rosario Scatamacchia (Q510910):
Displayed 19 items.
- A preliminary analysis of the distance based critical node problem (Q510911) (← links)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Approximation results for the incremental knapsack problem (Q1642685) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553) (← links)
- The longest processing time rule for identical parallel machines revisited (Q2173053) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints (Q2293085) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829) (← links)
- VNS solutions for the critical node problem (Q2631225) (← links)
- The connected critical node problem (Q2672625) (← links)
- Improved dynamic programming and approximation results for the knapsack problem with setups (Q4642123) (← links)
- Intermittency in the relative separations of tracers and of heavy particles in turbulent flows (Q4967926) (← links)
- The stochastic critical node problem over trees (Q6092626) (← links)
- The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming (Q6200147) (← links)