The following pages link to (Q3895490):
Displaying 11 items.
- Distance oracles for time-dependent networks (Q289929) (← links)
- On the complexity of time-dependent shortest paths (Q476455) (← links)
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual (Q817197) (← links)
- Parametric multiple sequence alignment and phylogeny construction (Q876718) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- A fast parametric assignment algorithm with applications in max-algebra (Q3057132) (← links)
- Optimal Embedding into Star Metrics (Q3183463) (← links)
- Complexity of some parametric integer and network programming problems (Q3712126) (← links)
- A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (Q5270613) (← links)
- Balancing profits and costs on trees (Q5326788) (← links)
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1 (Q5479833) (← links)
