Similar Search Results

A decomposition approach in a DSS for a resource constrained scheduling problem

Serafini, P.; Speranza, M. G. - In: European Journal of Operational Research 79 (1994) 2, pp. 208-219

Persistent link: https://www.econbiz.de/10005287663

A decomposition approach for a resource constrained scheduling problem

Serafini, P.; Speranza, M. G. - In: European Journal of Operational Research 75 (1994) 1, pp. 112-135

Persistent link: https://www.econbiz.de/10005283852

A mathematical model for the fixed-time traffic control problem

Serafini, Paolo; Ukovich, Walter - In: European Journal of Operational Research 42 (1989) 2, pp. 152-165

Persistent link: https://www.econbiz.de/10005236732

Periodic transportation schedules with flexible departure times : An interactive approach based on the periodic event scheduling problem and the deficit function approach

Gertsbakh, Ilya; Serafini, Paolo - In: European Journal of Operational Research 50 (1991) 3, pp. 298-309

Persistent link: https://www.econbiz.de/10005355214

Dynamic programming and minimum risk paths

Serafini, Paolo - In: European Journal of Operational Research 175 (2006) 1, pp. 224-237

Persistent link: https://www.econbiz.de/10005151550

Production scheduling problems in a textile industry

Serafini, Paolo; Grazia Speranza, M. - In: European Journal of Operational Research 58 (1992) 2, pp. 173-190

Persistent link: https://www.econbiz.de/10005283495

Two-dimensional packing problems: A survey

Lodi, Andrea; Martello, Silvano; Monaci, Michele - In: European Journal of Operational Research 141 (2002) 2, pp. 241-252

Persistent link: https://www.econbiz.de/10005337981

Lower bounds and heuristic algorithms for the ki-partitioning problem

Dell'Amico, Mauro; Iori, Manuel; Martello, Silvano; … - In: European Journal of Operational Research 171 (2006) 3, pp. 725-742

Persistent link: https://www.econbiz.de/10005283880

The Subset Sum game

Darmann, Andreas; Nicosia, Gaia; Pferschy, Ulrich; … - In: European Journal of Operational Research 233 (2014) 3, pp. 539-549

In this work we address a game theoretic variant of the Subset Sum problem, in which two decision makers (agents/players) compete for the usage of a common resource represented by a knapsack capacity. Each agent owns a set of integer weighted items and wants to maximize the total weight of its...

Persistent link: https://www.econbiz.de/10010871145

Approximation algorithms for knapsack problems with cardinality constraints

Caprara, Alberto; Kellerer, Hans; Pferschy, Ulrich; … - In: European Journal of Operational Research 123 (2000) 2, pp. 333-345

Persistent link: https://www.econbiz.de/10005337701