Antonio Sedeño‐Noda

700 total citations
35 papers, 446 citations indexed

About

Antonio Sedeño‐Noda is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Antonio Sedeño‐Noda has authored 35 papers receiving a total of 446 indexed citations (citations by other indexed papers that have themselves been cited), including 18 papers in Industrial and Manufacturing Engineering, 16 papers in Computational Theory and Mathematics and 7 papers in Computer Networks and Communications. Recurrent topics in Antonio Sedeño‐Noda's work include Vehicle Routing Optimization Methods (12 papers), Transportation Planning and Optimization (7 papers) and Complexity and Algorithms in Graphs (7 papers). Antonio Sedeño‐Noda is often cited by papers focused on Vehicle Routing Optimization Methods (12 papers), Transportation Planning and Optimization (7 papers) and Complexity and Algorithms in Graphs (7 papers). Antonio Sedeño‐Noda collaborates with scholars based in Spain, Germany and New Zealand. Antonio Sedeño‐Noda's co-authors include Marcos Colebrook, Andrea Raith, José M. Gutiérrez, Joaquı́n Sicilia, Ralf Borndörfer, David Alcaide López de Pablo, Marta Pascoal, Luitgard Kraus, Beatriz Abdul‐Jalbar and James B. Orlin and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Applied Mathematics and Computation.

In The Last Decade

Antonio Sedeño‐Noda

34 papers receiving 436 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Antonio Sedeño‐Noda Spain 13 203 112 84 81 79 35 446
Marta Pascoal Portugal 15 276 1.4× 301 2.7× 103 1.2× 54 0.7× 142 1.8× 42 923
Ouajdi Korbaa Tunisia 15 263 1.3× 187 1.7× 160 1.9× 72 0.9× 52 0.7× 119 788
Kim Allan Andersen Denmark 14 166 0.8× 57 0.5× 157 1.9× 30 0.4× 63 0.8× 27 556
Wenjing Luan China 13 93 0.5× 78 0.7× 124 1.5× 110 1.4× 26 0.3× 42 714
Moshe B. Rosenwein United States 13 490 2.4× 96 0.9× 53 0.6× 45 0.6× 22 0.3× 26 630
Tingting Cui China 9 148 0.7× 42 0.4× 16 0.2× 88 1.1× 32 0.4× 34 614
Fernando Paredes Chile 16 344 1.7× 97 0.9× 100 1.2× 42 0.5× 18 0.2× 61 764
Nancy V. Phillips United States 11 97 0.5× 71 0.6× 55 0.7× 30 0.4× 69 0.9× 22 378
Takayuki Osogami Japan 17 71 0.3× 380 3.4× 38 0.5× 259 3.2× 58 0.7× 64 801
Steffen Straßburger Germany 17 272 1.3× 172 1.5× 84 1.0× 200 2.5× 23 0.3× 92 820

Countries citing papers authored by Antonio Sedeño‐Noda

Since Specialization
Citations

This map shows the geographic impact of Antonio Sedeño‐Noda's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Antonio Sedeño‐Noda with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Antonio Sedeño‐Noda more than expected).

Fields of papers citing papers by Antonio Sedeño‐Noda

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Antonio Sedeño‐Noda. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Antonio Sedeño‐Noda. The network helps show where Antonio Sedeño‐Noda may publish in the future.

Co-authorship network of co-authors of Antonio Sedeño‐Noda

This figure shows the co-authorship network connecting the top 25 collaborators of Antonio Sedeño‐Noda. A scholar is included among the top collaborators of Antonio Sedeño‐Noda based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Antonio Sedeño‐Noda. Antonio Sedeño‐Noda is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Sedeño‐Noda, Antonio, et al.. (2024). New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem. Computers & Operations Research. 173. 106852–106852. 2 indexed citations
2.
Kraus, Luitgard, et al.. (2023). Targeted multiobjective Dijkstra algorithm. Networks. 82(3). 277–298. 10 indexed citations
3.
Sedeño‐Noda, Antonio, et al.. (2021). An Improved Multiobjective Shortest Path Algorithm. Computers & Operations Research. 135. 105424–105424. 24 indexed citations
4.
Raith, Andrea & Antonio Sedeño‐Noda. (2017). Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach. Computers & Operations Research. 82. 153–166. 5 indexed citations
5.
Sedeño‐Noda, Antonio. (2012). An efficient time and space K point-to-point shortest simple paths algorithm. Applied Mathematics and Computation. 218(20). 10244–10257. 11 indexed citations
6.
Sedeño‐Noda, Antonio, et al.. (2012). On the K best integer network flows. Computers & Operations Research. 40(2). 616–626. 5 indexed citations
7.
Sedeño‐Noda, Antonio, et al.. (2010). SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY. Asia Pacific Journal of Operational Research. 27(6). 677–691. 4 indexed citations
8.
Sedeño‐Noda, Antonio, et al.. (2010). An efficient label setting/correcting shortest path algorithm. Computational Optimization and Applications. 51(1). 437–455. 3 indexed citations
9.
Sedeño‐Noda, Antonio, et al.. (2009). On the K shortest path trees problem. European Journal of Operational Research. 202(3). 628–635. 10 indexed citations
10.
Sedeño‐Noda, Antonio, et al.. (2008). A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows. European Journal of Operational Research. 196(1). 140–154. 13 indexed citations
11.
Sedeño‐Noda, Antonio, et al.. (2005). Network flow approaches to pre-emptive open-shop scheduling problems with time-windows. European Journal of Operational Research. 174(3). 1501–1518. 14 indexed citations
12.
Gutiérrez, José M., Antonio Sedeño‐Noda, Marcos Colebrook, & Joaquı́n Sicilia. (2005). A polynomial algorithm for the production/ordering planning problem with limited storage. Computers & Operations Research. 34(4). 934–937. 18 indexed citations
13.
Sedeño‐Noda, Antonio, José M. Gutiérrez, Beatriz Abdul‐Jalbar, & Joaquı́n Sicilia. (2004). An O(T log T) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs. Computational Optimization and Applications. 28(3). 311–323. 12 indexed citations
14.
Sedeño‐Noda, Antonio, et al.. (2004). Solving the undirected minimum cost flow problem with arbitrary costs. Networks. 45(1). 1–3. 2 indexed citations
15.
Sedeño‐Noda, Antonio, et al.. (2004). The biobjective undirected two-commodity minimum cost flow problem. European Journal of Operational Research. 164(1). 89–103. 9 indexed citations
16.
Gutiérrez, José M., Antonio Sedeño‐Noda, Marcos Colebrook, & Joaquı́n Sicilia. (2002). A new characterization for the dynamic lot size problem with bounded inventory. Computers & Operations Research. 30(3). 383–395. 42 indexed citations
17.
Sedeño‐Noda, Antonio, et al.. (2001). An algorithm for the biobjective integer minimum cost flow problem. Computers & Operations Research. 28(2). 139–156. 31 indexed citations
18.
Sedeño‐Noda, Antonio, et al.. (2000). AO(nm log(U/n)) time maximum flow algorithm. Naval Research Logistics (NRL). 47(6). 511–520. 3 indexed citations
19.
Sedeño‐Noda, Antonio, et al.. (2000). The biobjective minimum cost flow problem. European Journal of Operational Research. 124(3). 591–600. 19 indexed citations
20.
Sedeño‐Noda, Antonio, et al.. (2000). An algorithmic study of the Maximum Flow problem: A comparative statistical analysis. Top. 8(1). 135–162. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Marta Pascoal Breakdown of academic impact, for papers by Ouajdi Korbaa Breakdown of academic impact, for papers by Kim Allan Andersen Breakdown of academic impact, for papers by Wenjing Luan Breakdown of academic impact, for papers by Moshe B. Rosenwein Breakdown of academic impact, for papers by Tingting Cui Breakdown of academic impact, for papers by Fernando Paredes Breakdown of academic impact, for papers by Nancy V. Phillips Breakdown of academic impact, for papers by Takayuki Osogami Breakdown of academic impact, for papers by Steffen Straßburger
Rankless by CCL
2026