The following pages link to Antonio Sedeño-Noda (Q296814):
Displaying 22 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)
- (Q856667) (redirect page) (← 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)
- (Q1728478) (redirect page) (← links)
- A biobjective Dijkstra algorithm (Q1728479) (← links)
- A new characterization for the dynamic lot size problem with bounded inventory (Q1869910) (← links)
- A generalization of the scaling max-flow algorithm (Q1885993) (← links)
- An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs (Q1888151) (← links)
- Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
- Solving a constrained economic lot size problem by ranking efficient production policies (Q2165759) (← links)
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746) (← links)
- An improved multiobjective shortest path algorithm (Q2669519) (← links)
- Targeted multiobjective Dijkstra algorithm (Q6139383) (← links)
