Folgen
Antonio Alberto Sedeño Noda
Antonio Alberto Sedeño Noda
Catedrático de Estadística e Investigación Operativa en Universidad de La Laguna
Bestätigte E-Mail-Adresse bei ull.edu.es
Titel
Zitiert von
Zitiert von
Jahr
A new characterization for the dynamic lot size problem with bounded inventory
J Gutiérrez, A Sedeño-Noda, M Colebrook, J Sicilia
Computers & Operations Research 30 (3), 383-395, 2003
912003
An algorithm for the biobjective integer minimum cost flow problem
A Sedeno-Noda, C González-Martın
Computers & Operations Research 28 (2), 139-156, 2001
702001
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
A Sedeno-Noda, A Raith
Computers & Operations Research 57, 83-94, 2015
592015
A biobjective Dijkstra algorithm
A Sedeño-Noda, M Colebrook
European Journal of Operational Research 276 (1), 106-118, 2019
512019
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
A Sedeño-Noda, D Alcaide, C González-Martín
European Journal of Operational Research 174 (3), 1501-1518, 2006
342006
The biobjective minimum cost flow problem
A Sedeño-Noda, C González-Martın
European Journal of Operational Research 124 (3), 591-600, 2000
342000
A polynomial algorithm for the production/ordering planning problem with limited storage
J Gutiérrez, A Sedeño-Noda, M Colebrook, J Sicilia
Computers & operations research 34 (4), 934-937, 2007
302007
An efficient approach for solving the lot-sizing problem with time-varying storage capacities
J Gutiérrez, A Sedeño-Noda, M Colebrook, J Sicilia
European Journal of Operational Research 189 (3), 682-693, 2008
262008
An O(nm) time algorithm for finding the min length directed cycle in a graph
JB Orlin, A Sedeño-Noda
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
252017
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
A Sedeño-Noda, S Alonso-Rodríguez
Applied Mathematics and Computation 265 (15), 602-618, 2015
242015
An efficient time and space K point-to-point shortest simple paths algorithm
A Sedeño-Noda
Applied Mathematics and Computation 218 (20), 10244-10257, 2012
222012
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
A Sedeño-Noda, DAL de Pablo, C González-Martín
European Journal of Operational Research 196 (1), 140-154, 2009
192009
An alternative method to solve the biobjective minimum cost flow problem
A Sedeño-Noda, C González-Martín
ASIA PACIFIC JOURNAL OF OPERATIONAL RESEARCH 20 (2), 241-260, 2003
192003
An O (T log T) algorithm for the dynamic lot size problem with limited storage and linear costs
A Sedeño-Noda, J Gutiérrez, B Abdul-Jalbar, J Sicilia
Computational Optimization and Applications 28 (3), 311-323, 2004
172004
Fast and fine quickest path algorithm
A Sedeño-Noda, JD González-Barrera
European Journal of Operational Research 238 (2), 596-606, 2014
162014
On the K shortest path trees problem
A Sedeño-Noda, C González-Martín
European Journal of Operational Research 202 (3), 628-635, 2010
152010
The biobjective undirected two-commodity minimum cost flow problem
A Sedeno-Noda, C González-Martı́n, J Gutiérrez
European journal of operational research 164 (1), 89-103, 2005
152005
On the K best integer network flows
A Sedeño-Noda, JJ Espino-Martín
Computers & operations research 40 (2), 616-626, 2013
92013
La Localización industrial en Canarias. Una aproximación Multicriterio
T Ravelo, C González, MC Moreno, A Sedeño Noda
Fundación FYDE-CajaCanarias, 2002
9*2002
A new strategy for the undirected two-commodity maximum flow problem
A Sedeño-Noda, C González-Martín, S Alonso-Rodríguez
Computational Optimization and Applications 47 (2), 289-305, 2010
82010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20