logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Back
A

Antonio Sedeño‐Noda

universidad de la laguna

15H-index
50Paper Count
700Citation Count
Published Papers 25
Publication Date
logo
A bi-objective sustainable EOQ model with all-units discounts
errOMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
IF7.2
err2026-01-21
err0
PREAI
errGutierrez, Jose M.; Sedeno-Noda, Antonio
errShare
errSave
K-shortest simple paths using biobjective path search
errMATHEMATICAL PROGRAMMING COMPUTATION
IF3.6
err2025-02-13
err0
errOAAI
errde las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf; Huneshagen, Max
errShare
errSave
New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2025-01-01
err0
PREAI
errde las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf
errShare
errSave
A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands
errCOMPUTERS & INDUSTRIAL ENGINEERING
IF6.5
err2023-12-01
err0
errOAAI
errEsquivel-Gonzalez, Guillermo; Leon, Gines; Sedeno-Noda, Antonio
errShare
errSave
An Improved Multiobjective Shortest Path Algorithm
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2021-11-01
err21
PREAI
errde las Casas, Pedro Maristany; Sedeno-Noda, Antonio; Borndoerfer, Ralf
errShare
errSave
A biobjective Dijkstra algorithm
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2019-07-01
err56
PREAI
errSedeno-noda, Antonio; Colebrook, Marcos
errShare
errSave
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2017-06-01
err4
errOAAI
errRaith, Andrea; Sedeno-Noda, Antonio
errShare
errSave
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
errAPPLIED MATHEMATICS AND COMPUTATION
IF3.4
err2015-08-01
err26
PREAI
errSedeno-Noda, Antonio; Alonso-Rodriguez, Sergio
errShare
errSave
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2015-05-01
err46
errOAAI
errSedeno-Noda, Antonio; Raith, Andrea
errShare
errSave
Fast and fine quickest path algorithm
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2014-10-01
err14
PREAI
errSedeno-Noda, Antonio; Gonzalez-Barrera, Jonathan D.
errShare
errSave
On the K best integer network flows
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2013-02-01
err7
PREAI
errSedeno-Noda, Antonio; Jose Espino-Martin, Juan
errShare
errSave
Enumerating K best paths in length order in DAGs
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2012-09-01
err8
PREAI
errPascoal, Marta M. B.; Sedeno-Noda, Antonio
errShare
errSave
An efficient time and space K point-to-point shortest simple paths algorithm
errAPPLIED MATHEMATICS AND COMPUTATION
IF3.4
err2012-06-01
err13
PREAI
errSedeno-Noda, Antonio
errShare
errSave
On the K shortest path trees problem
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2010-05-01
err11
errOAAI
errSedeno-Noda, Antonio; Gonzalez-Martin, Carlos
errShare
errSave
Optimality conditions in preference-based spanning tree problems
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2009-10-01
err2
PREAI
errAlonso, Sergio; Angel Dominguez-Rios, Miguel; Colebrook, Marcos; Sedeno-Noda, Antonio
errShare
errSave
Preemptive benchmarking problem: An approach for official statistics in small areas
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2009-07-01
err1
PREAI
errSedeno-Noda, A.; Gonzalez-Davila, E.; Gonzalez-Martin, C.; Gonzalez-Yanes, A.
errShare
errSave
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2009-07-01
err16
PREAI
errSedeno-Noda, A.; Alcaide-Lopez-de-Pablo, David; Gonzalez-Martin, C.
errShare
errSave
An efficient approach for solving the lot-sizing problem with time-varying storage capacities
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2008-09-01
err14
PREAI
errGutierrez, J.; Sedeno-Noda, A.; Colebrook, M.; Sicilia, J.
errShare
errSave
A polynomial algorithm for the production/ordering planning problem with limited storage
errCOMPUTERS & OPERATIONS RESEARCH
IF4.3
err2007-04-01
err19
PREAI
errGutierrez, J.; Sedeno-Noda, A.; Colebrook, M.; Sicilia, J.
errShare
errSave
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
errEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
IF6
err2006-11-01
err15
PREAI
errSedeno-Noda, A.; Alcaide, D.; Gonzalez-Martin, C.
errShare
errSave

Research Directions

The data has not been retrieved yet.
Co-authors
Cooperation Journals
S
Sergio Alonso
H-index: 32 · Papers: 186
J
Joaquı́n Sicilia
H-index: 30 · Papers: 103
R
Ralf Borndörfer
H-index: 25 · Papers: 223
E
Enrique González‐Dávila
H-index: 20 · Papers: 108
A
Andrea Raith
H-index: 17 · Papers: 71
View more