Antonio Sedeño-Noda

38 papers A* 1Journal 37
YearRankTypeTitle / Venue / Authors
2025 J jnl
K-shortest simple paths using biobjective path search.
Math. Program. Comput.
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer, Max Huneshagen
2025 J jnl
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem.
Comput. Oper. Res.
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer
2023 J jnl
A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands.
Comput. Ind. Eng.
Guillermo Esquivel-González, Ginés León, Antonio Sedeño-Noda
2023 J jnl
K-Shortest Simple Paths Using Biobjective Path Search.
CoRR
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer, Max Huneshagen
2023 J jnl
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem.
CoRR
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer
2023 J jnl
Targeted multiobjective Dijkstra algorithm.
Networks
Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer
2021 J jnl
An FPTAS for Dynamic Multiobjective Shortest Path Problems.
Algorithms
Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus, Antonio Sedeño-Noda
2021 J jnl
An Improved Multiobjective Shortest Path Algorithm.
Comput. Oper. Res.
Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer
2021 J jnl
Multiobjective Dijkstra A.
CoRR
Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer
2019 J jnl
A biobjective Dijkstra algorithm.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, Marcos Colebrook
2017 A* conf
An
SODA
James B. Orlin, Antonio Sedeño-Noda
2017 J jnl
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach.
Comput. Oper. Res.
Andrea Raith, Antonio Sedeño-Noda
2016 J jnl
Ranking One Million Simple Paths in Road Networks.
Asia Pac. J. Oper. Res.
Antonio Sedeño-Noda
2015 J jnl
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem.
Comput. Oper. Res.
Antonio Sedeño-Noda, Andrea Raith
2015 J jnl
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem.
Appl. Math. Comput.
Antonio Sedeño-Noda, Sergio Alonso-Rodríguez
2014 J jnl
Fast and fine quickest path algorithm.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, Jonathan D. González-Barrera
2013 J jnl
On the K best integer network flows.
Comput. Oper. Res.
Antonio Sedeño-Noda, Juan José Espino-Martín
2013 J jnl
On the second point-to-point undirected shortest simple path problem.
Optim. Lett.
Antonio Sedeño-Noda, Carlos González-Martín
2012 J jnl
An efficient label setting/correcting shortest path algorithm.
Comput. Optim. Appl.
Antonio Sedeño-Noda, Carlos González-Martín
2012 J jnl
An efficient time and space K point-to-point shortest simple paths algorithm.
Appl. Math. Comput.
Antonio Sedeño-Noda
2012 J jnl
Enumerating K best paths in length order in DAGs.
Eur. J. Oper. Res.
Marta M. B. Pascoal, Antonio Sedeño-Noda
2010 J jnl
A new strategy for the undirected two-commodity maximum flow problem.
Comput. Optim. Appl.
Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez
2010 J jnl
On the K shortest path trees problem.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, Carlos González-Martín
2010 J jnl
Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study.
Asia Pac. J. Oper. Res.
Antonio Sedeño-Noda, Carlos González-Martín
2009 J jnl
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín
2009 J jnl
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels.
Comput. Optim. Appl.
Antonio Sedeño-Noda, Carlos González-Martín
2009 J jnl
Optimality conditions in preference-based spanning tree problems.
Eur. J. Oper. Res.
Sergio Alonso-Rodríguez, Miguel Ángel Domínguez-Ríos, Marcos Colebrook, Antonio Sedeño-Noda
2009 J jnl
Preemptive benchmarking problem: An approach for official statistics in small areas.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, Enrique González-Dávila, Carlos González-Martín, Alberto González-Yanes
2008 J jnl
An efficient approach for solving the lot-sizing problem with time-varying storage capacities.
Eur. J. Oper. Res.
Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia
2007 J jnl
A polynomial algorithm for the production/ordering planning problem with limited storage.
Comput. Oper. Res.
Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia
2006 J jnl
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín
2005 J jnl
Solving the undirected minimum cost flow problem with arbitrary costs.
Networks
Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez
2005 J jnl
The biobjective undirected two-commodity minimum cost flow problem.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, Carlos González-Martín, Jose Gutiérrez
2004 J jnl
A generalization of the scaling max-flow algorithm.
Comput. Oper. Res.
Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez
2004 J jnl
An
Comput. Optim. Appl.
Antonio Sedeño-Noda, Jose Gutiérrez, Beatriz Abdul-Jalbar, Joaquin Sicilia
2003 J jnl
A new characterization for the dynamic lot size problem with bounded inventory.
Comput. Oper. Res.
Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia
2001 J jnl
An algorithm for the biobjective integer minimum cost flow problem.
Comput. Oper. Res.
Antonio Sedeño-Noda, Carlos González-Martín
2000 J jnl
The biobjective minimum cost flow problem.
Eur. J. Oper. Res.
Antonio Sedeño-Noda, Carlos González-Martín