120 citations · 268 across the 16 of their papers we have counts for
3 papers · 1 filter
Geometric and LP-based heuristics for the quadratic travelling salesman problem
Rostislav Staněk, Peter Greistorfer, Klaus Ladner +1
A generalization of the classical TSP is the so-called quadratic travelling salesman problem (QTSP), in which a cost coefficient is associated with the transition in every vertex,…
Approximating the Incremental Knapsack Problem
Federico Della Croce, Ulrich Pferschy, Rosario Scatamacchia
We consider the 0-1 Incremental Knapsack Problem (IKP) where the capacity grows over time periods and if an item is placed in the knapsack in a certain period, it cannot be removed…
On a Stackelberg Subset Sum Game
Ulrich Pferschy, Gaia Nicosia, Andrea Pacifici
This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set of items with given int…