The following pages link to Antonio Sedeño-Noda (Q296814):
Displaying 12 items.
- Fast and fine quickest path algorithm (Q296816) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- On the \(K\) best integer network flows (Q340269) (← links)
- On the second point-to-point undirected shortest simple path problem (Q395858) (← links)
- An efficient label setting/correcting shortest path algorithm (Q434184) (← links)
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
- A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668) (← links)
- Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
- On the \(K\) shortest path trees problem (Q1040982) (← links)
- Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach (Q1652278) (← links)
- An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
