Antonio Sedeño-Noda

Available identifiers

zbMath Open sedeno-noda.antonioWikidataQ56476123 ScholiaQ56476123MaRDI QIDQ296814

List of research outcomes

Publication	Date of Publication	Type
Targeted multiobjective Dijkstra algorithm	2023-12-18	Paper
Solving a constrained economic lot size problem by ranking efficient production policies	2022-08-23	Paper
An improved multiobjective shortest path algorithm	2022-03-09	Paper
A biobjective Dijkstra algorithm	2019-02-25	Paper
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem	2018-08-24	Paper
An O(nm) time algorithm for finding the min length directed cycle in a graph	2018-07-16	Paper
Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach	2018-07-11	Paper
Ranking One Million Simple Paths in Road Networks	2016-12-16	Paper
On the \(K\) best integer network flows	2016-11-14	Paper
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem	2016-11-10	Paper
Fast and fine quickest path algorithm	2016-06-23	Paper
On the second point-to-point undirected shortest simple path problem	2014-01-30	Paper
Enumerating \(K\) best paths in length order in DAGs	2012-12-29	Paper
An efficient time and space \(K\) point-to-point shortest simple paths algorithm	2012-08-30	Paper
An efficient label setting/correcting shortest path algorithm	2012-07-10	Paper
On the \(K\) shortest path trees problem	2009-11-27	Paper
Optimality conditions in preference-based spanning tree problems	2009-06-30	Paper
An efficient approach for solving the lot-sizing problem with time-varying storage capacities	2008-04-24	Paper
A polynomial algorithm for the production/ordering planning problem with limited storage	2006-12-07	Paper
https://portal.mardi4nfdi.de/entity/Q4672556	2005-05-03	Paper
An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs	2004-11-22	Paper
A generalization of the scaling max-flow algorithm	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q4794411	2003-06-02	Paper
A new characterization for the dynamic lot size problem with bounded inventory	2003-04-28	Paper
AO(nm log(U/n)) time maximum flow algorithm	2002-01-27	Paper

Research outcomes over time

This page was built for person: Antonio Sedeño-Noda