activity
20132023
most citedThe constant objective value property for combinatorial optimization problems

3 citations · 11 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2023★ 1 cited

A linear time algorithm for linearizing quadratic and higher-order shortest path problems

Eranda Çela, Bettina Klinz, Stefan Lendl +2

An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same…