A Aralex Aachen research explorer

Search

From

To

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Papers matching “polynomial-time solvability” 1

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

The bipartite travelling salesman problem: A pyramidally solvable case
2024 Operations Research Letters article Engineering Maritime Ports and Logistics Open access

Vladimir G. Deı̌neko, Bettina Klinz, Gerhard J. Woeginger

2

citations

1 result