EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
3351. Relaxations for the elementary shortest path problem
Invited abstract in session WB-38: Convex and conic optimization, stream Conic Optimization: Theory, Algorithms, and Applications.
Wednesday, 10:30-12:00Room: 34 (building: 306)
Authors (first author is the speaker)
| 1. | Mirjam Duer
|
| Augsburg University | |
| 2. | Regina Schmidt
|
| University of Augsburg |
Abstract
Given a directed graph with negative edge costs and possibly negative cycles, the elementary shortst path problem consists in finding a shortest elementary path, i.e., a path from a source node to a target node that visits each node at most once. In this talk, we discuss various formulations and relaxations for this NP-hard problem.
Keywords
- Combinatorial Optimization
Status: accepted
Back to the list of papers