Pages that link to "Item:Q512936"
From MaRDI portal
The following pages link to Exact methods for solving the elementary shortest and longest path problems (Q512936):
Displaying 11 items.
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- Global optimization for scaffolding and completing genome assemblies (Q1742221) (← links)
- On exact solution approaches for the longest induced path problem (Q1999389) (← links)
- Valid inequalities and lifting procedures for the shortest path problem in digraphs with negative cycles (Q2017836) (← links)
- Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
- (Q3506121) (← links)
- Pre-treatment of path problems with required lengths (Q5070029) (← links)
- (Q5688122) (← links)
- On the shortest path problem with negative cost cycles (Q5963684) (← links)
- Recoverable robust shortest path problem under interval budgeted uncertainty representations (Q6663971) (← links)