×

zbMATH — the first resource for mathematics

Sedeño-Noda, Antonio

Compute Distance To:
Author ID: sedeno-noda.antonio Recent zbMATH articles by "Sedeño-Noda, Antonio"
Published as: Sedeño-Noda, A.; Sedeño-Noda, Antonio; Sedeño Noda, Antonio; Sedeño Noda, A.; Sedeño-noda, Antonio
External Links: ORCID
Documents Indexed: 37 Publications since 1998

Publications by Year

Citations contained in zbMATH Open

27 Publications have been cited 121 times in 46 Documents Cited by Year
An algorithm for the biobjective integer minimum cost flow problem. Zbl 0990.90122
Sedeño-Noda, A.; González-Martín, C.
20
2001
A new characterization for the dynamic lot size problem with bounded inventory. Zbl 1029.90006
Gutiérrez, J.; Sedeño-Noda, A.; Colebrook, M.; Sicilia, J.
17
2003
The biobjective minimum cost flow problem. Zbl 0969.90020
Sedeño-Noda, A.; González-Martín, C.
9
2000
A polynomial algorithm for the production/ordering planning problem with limited storage. Zbl 1102.90001
Gutiérrez, J.; Sedeño-Noda, A.; Colebrook, M.; Sicilia, J.
8
2007
An alternative method to solve the biobjective minimum cost flow problem. Zbl 1165.90663
Sedeño-Noda, A.; González-Martin, C.
7
2003
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows. Zbl 1103.90048
Sedeño-Noda, A.; Alcaide, D.; González-Martín, C.
6
2006
The biobjective undirected two-commodity minimum cost flow problem. Zbl 1132.90368
Sedeño-Noda, A.; González-Martín, C.; Gutiérrez, J.
5
2005
Shortest path simplex algorithm with a multiple pivot rule: a comparative study. Zbl 1230.90191
Sedeño-Noda, A.; González-Martín, C.
4
2010
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Zbl 1348.90607
Sedeño-Noda, Antonio; Raith, Andrea
4
2015
An efficient approach for solving the lot-sizing problem with time-varying storage capacities. Zbl 1146.90313
Gutiérrez, J.; Sedeño-Noda, A.; Colebrook, M.; Sicilia, J.
4
2008
An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs. Zbl 1084.90010
Sedeño-Noda, A.; Gutiérrez, J.; Abdul-Jalbar, B.; Sicilia, J.
4
2004
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows. Zbl 1161.90007
Sedeño-Noda, A.; de Pablo, D. Alcaide López; González-Martín, C.
4
2009
Fast and fine quickest path algorithm. Zbl 1338.90433
Sedeño-Noda, Antonio; González-Barrera, Jonathan D.
4
2014
An \(O(nm\log(U/n))\) time maximum flow algorithm. Zbl 0977.90076
Sedeño-Noda, Antonio; González-Martín, Carlos
3
2000
On the \(K\) shortest path trees problem. Zbl 1176.90614
Sedeño-Noda, Antonio; González-Martín, Carlos
3
2010
An efficient time and space \(K\) point-to-point shortest simple paths algorithm. Zbl 1253.65098
Sedeño-Noda, Antonio
3
2012
Enumerating \(K\) best paths in length order in DAGs. Zbl 1253.90201
Pascoal, Marta M. B.; Sedeño-Noda, Antonio
3
2012
An algorithmic study of the maximum flow problem: A comparative statistical analysis. Zbl 0966.90067
Sedeño-Noda, A.; González-Sierra, M. A.; González-Martín, C.
2
2000
Optimality conditions in preference-based spanning tree problems. Zbl 1163.90791
Alonso, Sergio; Domínguez-Ríos, Miguel Ángel; Colebrook, Marcos; Sedeño-Noda, Antonio
2
2009
A biobjective Dijkstra algorithm. Zbl 1430.90517
Sedeño-noda, Antonio; Colebrook, Marcos
2
2019
New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels. Zbl 1170.90511
Sedeño-Noda, A.; González-Martín, C.
1
2009
A new strategy for the undirected two-commodity maximum flow problem. Zbl 1200.90034
Sedeño-Noda, A.; González-Martín, C.; Alonso-Rodríguez, S.
1
2010
A generalization of the scaling max-flow algorithm. Zbl 1068.68172
Sedeño-Noda, Antonio; González-Martín, Carlos; Alonso, Sergio
1
2004
Solving the undirected minimum cost flow problem with arbitrary costs. Zbl 1061.68016
Sedeño-Noda, A.; González-Martín, C.; Alonso, S.
1
2005
An \(O(nm)\) time algorithm for finding the min length directed cycle in a graph. Zbl 1410.68304
Orlin, James B.; Sedeño-Noda, Antonio
1
2017
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. Zbl 1410.90233
Sedeño-Noda, Antonio; Alonso-Rodríguez, Sergio
1
2015
An efficient label setting/correcting shortest path algorithm. Zbl 1244.90236
Sedeño-Noda, Antonio; González-Martín, Carlos
1
2012
A biobjective Dijkstra algorithm. Zbl 1430.90517
Sedeño-noda, Antonio; Colebrook, Marcos
2
2019
An \(O(nm)\) time algorithm for finding the min length directed cycle in a graph. Zbl 1410.68304
Orlin, James B.; Sedeño-Noda, Antonio
1
2017
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem. Zbl 1348.90607
Sedeño-Noda, Antonio; Raith, Andrea
4
2015
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem. Zbl 1410.90233
Sedeño-Noda, Antonio; Alonso-Rodríguez, Sergio
1
2015
Fast and fine quickest path algorithm. Zbl 1338.90433
Sedeño-Noda, Antonio; González-Barrera, Jonathan D.
4
2014
An efficient time and space \(K\) point-to-point shortest simple paths algorithm. Zbl 1253.65098
Sedeño-Noda, Antonio
3
2012
Enumerating \(K\) best paths in length order in DAGs. Zbl 1253.90201
Pascoal, Marta M. B.; Sedeño-Noda, Antonio
3
2012
An efficient label setting/correcting shortest path algorithm. Zbl 1244.90236
Sedeño-Noda, Antonio; González-Martín, Carlos
1
2012
Shortest path simplex algorithm with a multiple pivot rule: a comparative study. Zbl 1230.90191
Sedeño-Noda, A.; González-Martín, C.
4
2010
On the \(K\) shortest path trees problem. Zbl 1176.90614
Sedeño-Noda, Antonio; González-Martín, Carlos
3
2010
A new strategy for the undirected two-commodity maximum flow problem. Zbl 1200.90034
Sedeño-Noda, A.; González-Martín, C.; Alonso-Rodríguez, S.
1
2010
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows. Zbl 1161.90007
Sedeño-Noda, A.; de Pablo, D. Alcaide López; González-Martín, C.
4
2009
Optimality conditions in preference-based spanning tree problems. Zbl 1163.90791
Alonso, Sergio; Domínguez-Ríos, Miguel Ángel; Colebrook, Marcos; Sedeño-Noda, Antonio
2
2009
New efficient shortest path simplex algorithm: Pseudo permanent labels instead of permanent labels. Zbl 1170.90511
Sedeño-Noda, A.; González-Martín, C.
1
2009
An efficient approach for solving the lot-sizing problem with time-varying storage capacities. Zbl 1146.90313
Gutiérrez, J.; Sedeño-Noda, A.; Colebrook, M.; Sicilia, J.
4
2008
A polynomial algorithm for the production/ordering planning problem with limited storage. Zbl 1102.90001
Gutiérrez, J.; Sedeño-Noda, A.; Colebrook, M.; Sicilia, J.
8
2007
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows. Zbl 1103.90048
Sedeño-Noda, A.; Alcaide, D.; González-Martín, C.
6
2006
The biobjective undirected two-commodity minimum cost flow problem. Zbl 1132.90368
Sedeño-Noda, A.; González-Martín, C.; Gutiérrez, J.
5
2005
Solving the undirected minimum cost flow problem with arbitrary costs. Zbl 1061.68016
Sedeño-Noda, A.; González-Martín, C.; Alonso, S.
1
2005
An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs. Zbl 1084.90010
Sedeño-Noda, A.; Gutiérrez, J.; Abdul-Jalbar, B.; Sicilia, J.
4
2004
A generalization of the scaling max-flow algorithm. Zbl 1068.68172
Sedeño-Noda, Antonio; González-Martín, Carlos; Alonso, Sergio
1
2004
A new characterization for the dynamic lot size problem with bounded inventory. Zbl 1029.90006
Gutiérrez, J.; Sedeño-Noda, A.; Colebrook, M.; Sicilia, J.
17
2003
An alternative method to solve the biobjective minimum cost flow problem. Zbl 1165.90663
Sedeño-Noda, A.; González-Martin, C.
7
2003
An algorithm for the biobjective integer minimum cost flow problem. Zbl 0990.90122
Sedeño-Noda, A.; González-Martín, C.
20
2001
The biobjective minimum cost flow problem. Zbl 0969.90020
Sedeño-Noda, A.; González-Martín, C.
9
2000
An \(O(nm\log(U/n))\) time maximum flow algorithm. Zbl 0977.90076
Sedeño-Noda, Antonio; González-Martín, Carlos
3
2000
An algorithmic study of the maximum flow problem: A comparative statistical analysis. Zbl 0966.90067
Sedeño-Noda, A.; González-Sierra, M. A.; González-Martín, C.
2
2000
all top 5

Cited by 87 Authors

9 Sedeño-Noda, Antonio
4 Colebrook, Marcos
4 Gutiérrez, José Miguel
3 Brahimi, Nadjib
3 Dauzère-Pérès, Stéphane
3 Sicilia, Joaquín
2 Absi, Nabil
2 Akbalik, Ayse
2 Bard, Jonathan F.
2 Calvete, Herminia I.
2 del Pozo, Lourdes
2 Iranzo, José A.
2 Jing, Fuying
2 Kedad-Sidhoum, Safia
2 Mu, Yinping
2 Nananukul, Narameth
2 Nordli, Atle
2 Penz, Bernard
2 Rapine, Christophe
2 van den Heuvel, Wilco
1 Abdul-Jalbar, Beatriz
1 Alba, Enrique
1 Alonso Rodríguez, Sergio Fernando
1 Alonso, Sergio
1 Bashir, Muhammad Farhan
1 Breugem, Thomas
1 Çalışkan, Cenk
1 Cerf, Max
1 Chow, Shui-Nee
1 Cintrano, C.
1 Ciurea, Eleonor
1 Deaconu, Adrian
1 Degraeve, Zeger
1 Di Puglia Pugliese, Luigi
1 Dietz, Tobias
1 Dollevoet, Twan
1 Dou, Ronggang
1 Fan, Jie
1 Fang, Jia
1 Fernandes, Islame F. C.
1 Figueira, José Rui
1 Fröhlich, Nicolas
1 Goldbarg, Elizabeth Ferreira Gouvêa
1 Goldbarg, Marco César
1 González Martín, Carlos
1 Guan, Yongpei
1 Guerriero, Francesca
1 Han, Song
1 He, Jingjing
1 Huang, Dong
1 Hwang, Hark-Chin
1 Jane, Chin-Chia
1 Jans, Raf
1 Kiranoudis, Christos T.
1 Laih, Yih-Wenn
1 Lam, Kam-Yiu
1 Li, Chung-Lun
1 Li, Qingying
1 Li, Xun
1 Liping, Ma
1 Liu, Shiwen
1 Liu, Tieming
1 Liu, Xiao
1 Lu, Jun
1 Maia, S. M. D. M.
1 Melchiori, Anna
1 Najid, Najib Mohamed
1 Pascoal, Marta Margarida Braz
1 Pascual, Fanny
1 Petinis, V. V.
1 Phouratsamay, Siao-Leu
1 Poss, Michael
1 Qi, Jianxun
1 Raith, Andrea
1 Ruzika, Stefan
1 Schäfer, Luca E.
1 Sgalambro, Antonino
1 Su, Chwen-Tzeng
1 Su, Zhixiong
1 Tarantilis, Christos D.
1 Wang, Guoqing
1 Wang, Xiaolong
1 Wei, Hanying
1 Wong, Jui-Tsung
1 Wu, Dandan
1 Zhou, Hao-Min
1 Zhu, Chun Jiang

Citations by Year