Pages that link to "Item:Q5945392"
From MaRDI portal
The following pages link to A simple efficient approximation scheme for the restricted shortest path problem (Q5945392):
Displayed 10 items.
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
- A PTAS for weight constrained Steiner trees in series--parallel graphs. (Q1401399) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
- Approximation schemes for a class of subset selection problems (Q2381527) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
- Effective Algorithms for a Class of Discrete Valued Optimal Control Problems (Q3589728) (← links)
- Constrained Steiner trees in Halin graphs (Q4467896) (← links)
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms (Q5308327) (← links)