default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Sedeño-Noda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j33]Pedro Maristany de las Casas
, Antonio Sedeño-Noda, Ralf Borndörfer:
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem. Comput. Oper. Res. 173: 106852 (2025)- 2023
- [j32]Guillermo Esquivel-González, Ginés León, Antonio Sedeño-Noda:
A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands. Comput. Ind. Eng. 186: 109762 (2023) - [j31]Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer:
Targeted multiobjective Dijkstra algorithm. Networks 82(3): 277-298 (2023) - [i3]Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer:
New Dynamic Programming Algorithm for the Multiobjective Minimum Spanning Tree Problem. CoRR abs/2306.16203 (2023) - [i2]Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer, Max Huneshagen:
K-Shortest Simple Paths Using Biobjective Path Search. CoRR abs/2309.10377 (2023) - 2021
- [j30]Pedro Maristany de las Casas, Ralf Borndörfer, Luitgard Kraus, Antonio Sedeño-Noda:
An FPTAS for Dynamic Multiobjective Shortest Path Problems. Algorithms 14(2): 43 (2021) - [j29]Pedro Maristany de las Casas, Antonio Sedeño-Noda, Ralf Borndörfer:
An Improved Multiobjective Shortest Path Algorithm. Comput. Oper. Res. 135: 105424 (2021) - [i1]Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer:
Multiobjective Dijkstra A. CoRR abs/2110.10978 (2021)
2010 – 2019
- 2019
- [j28]Antonio Sedeño-Noda, Marcos Colebrook:
A biobjective Dijkstra algorithm. Eur. J. Oper. Res. 276(1): 106-118 (2019) - 2017
- [j27]Andrea Raith, Antonio Sedeño-Noda:
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach. Comput. Oper. Res. 82: 153-166 (2017) - [c1]James B. Orlin, Antonio Sedeño-Noda:
An O(nm) time algorithm for finding the min length directed cycle in a graph. SODA 2017: 1866-1879 - 2016
- [j26]Antonio Sedeño-Noda:
Ranking One Million Simple Paths in Road Networks. Asia Pac. J. Oper. Res. 33(5): 1650042:1-1650042:20 (2016) - 2015
- [j25]Antonio Sedeño-Noda, Sergio Alonso-Rodríguez:
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. Appl. Math. Comput. 265: 602-618 (2015) - [j24]Antonio Sedeño-Noda, Andrea Raith:
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Comput. Oper. Res. 57: 83-94 (2015) - 2014
- [j23]Antonio Sedeño-Noda, Jonathan D. González-Barrera:
Fast and fine quickest path algorithm. Eur. J. Oper. Res. 238(2): 596-606 (2014) - 2013
- [j22]Antonio Sedeño-Noda, Juan José Espino-Martín:
On the K best integer network flows. Comput. Oper. Res. 40(2): 616-626 (2013) - [j21]Antonio Sedeño-Noda, Carlos González-Martín:
On the second point-to-point undirected shortest simple path problem. Optim. Lett. 7(8): 1875-1881 (2013) - 2012
- [j20]Antonio Sedeño-Noda:
An efficient time and space K point-to-point shortest simple paths algorithm. Appl. Math. Comput. 218(20): 10244-10257 (2012) - [j19]Antonio Sedeño-Noda, Carlos González-Martín:
An efficient label setting/correcting shortest path algorithm. Comput. Optim. Appl. 51(1): 437-455 (2012) - [j18]Marta M. B. Pascoal, Antonio Sedeño-Noda:
Enumerating K best paths in length order in DAGs. Eur. J. Oper. Res. 221(2): 308-316 (2012) - 2010
- [j17]Antonio Sedeño-Noda, Carlos González-Martín:
Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study. Asia Pac. J. Oper. Res. 27(6): 677-691 (2010) - [j16]Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez:
A new strategy for the undirected two-commodity maximum flow problem. Comput. Optim. Appl. 47(2): 289-305 (2010) - [j15]Antonio Sedeño-Noda, Carlos González-Martín:
On the K shortest path trees problem. Eur. J. Oper. Res. 202(3): 628-635 (2010)
2000 – 2009
- 2009
- [j14]Antonio Sedeño-Noda, Carlos González-Martín:
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels. Comput. Optim. Appl. 43(3): 437-448 (2009) - [j13]Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín:
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows. Eur. J. Oper. Res. 196(1): 140-154 (2009) - [j12]Antonio Sedeño-Noda, Enrique González-Dávila, Carlos González-Martín, Alberto González-Yanes:
Preemptive benchmarking problem: An approach for official statistics in small areas. Eur. J. Oper. Res. 196(1): 360-369 (2009) - [j11]Sergio Alonso-Rodríguez, Miguel Ángel Domínguez-Ríos, Marcos Colebrook, Antonio Sedeño-Noda:
Optimality conditions in preference-based spanning tree problems. Eur. J. Oper. Res. 198(1): 232-240 (2009) - 2008
- [j10]Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia:
An efficient approach for solving the lot-sizing problem with time-varying storage capacities. Eur. J. Oper. Res. 189(3): 682-693 (2008) - 2007
- [j9]Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia:
A polynomial algorithm for the production/ordering planning problem with limited storage. Comput. Oper. Res. 34(4): 934-937 (2007) - 2006
- [j8]Antonio Sedeño-Noda, David Alcaide López de Pablo, Carlos González-Martín:
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows. Eur. J. Oper. Res. 174(3): 1501-1518 (2006) - 2005
- [j7]Antonio Sedeño-Noda, Carlos González-Martín, Jose Gutiérrez:
The biobjective undirected two-commodity minimum cost flow problem. Eur. J. Oper. Res. 164(1): 89-103 (2005) - [j6]Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez:
Solving the undirected minimum cost flow problem with arbitrary costs. Networks 45(1): 1-3 (2005) - 2004
- [j5]Antonio Sedeño-Noda, Jose Gutiérrez, Beatriz Abdul-Jalbar, Joaquin Sicilia:
An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs. Comput. Optim. Appl. 28(3): 311-323 (2004) - [j4]Antonio Sedeño-Noda, Carlos González-Martín, Sergio Alonso-Rodríguez:
A generalization of the scaling max-flow algorithm. Comput. Oper. Res. 31(13): 2183-2198 (2004) - 2003
- [j3]Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia:
A new characterization for the dynamic lot size problem with bounded inventory. Comput. Oper. Res. 30(3): 383-395 (2003) - 2001
- [j2]Antonio Sedeño-Noda, Carlos González-Martín:
An algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 28(2): 139-156 (2001) - 2000
- [j1]Antonio Sedeño-Noda, Carlos González-Martín:
The biobjective minimum cost flow problem. Eur. J. Oper. Res. 124(3): 591-600 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
