Argitalpenak (78) Antonio Alberto Sedeño Noda argitalpenak

2025

  1. New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem

    Computers and Operations Research, Vol. 173

2023

  1. A Biobjective Optimization Model to decide the lines attending a bus-stop with high passenger demands

    XV Congreso de Ingeniería del Transporte (15º. La Laguna. 2023) (Universidad de La Laguna), pp. 1211-1220

  2. A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands

    Computers and Industrial Engineering, Vol. 186

  3. Resource Optimization Problem to meet passenger demand in a public transport company

    XV Conference on Transport Engineering, CIT2023

  4. Resource optimization problems to meet passenger demand in a public transport company

    XV Congreso de Ingeniería del Transporte (15º. La Laguna. 2023) (Universidad de La Laguna), pp. 184-194

  5. Targeted multiobjective Dijkstra algorithm

    Networks, Vol. 82, Núm. 3, pp. 277-298

  6. The problem of assigning bus drivers to trips in a Spanish public transport company

    Engineering Optimization, Vol. 55, Núm. 9, pp. 1597-1615

2022

  1. SOLVING A CONSTRAINED ECONOMIC LOT SIZE PROBLEM BY RANKING EFFICIENT PRODUCTION POLICIES

    Journal of Industrial and Management Optimization, Vol. 18, Núm. 5, pp. 3055-3071

2021

  1. An Improved Multiobjective Shortest Path Algorithm

    Computers and Operations Research, Vol. 135

  2. An fptas for dynamic multiobjective shortest path problems

    Algorithms, Vol. 14, Núm. 2

2019

  1. A biobjective Dijkstra algorithm

    European Journal of Operational Research, Vol. 276, Núm. 1, pp. 106-118

2018

  1. The multiobjective Dijkstra’s algorithm

    European Conference on Operational Research. EURO2018. (29, 2018, Valencia)

2017

  1. An <i>O</i>(<i>nm</i>) time algorithm for finding the min length directed cycle in a graph

    PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS

  2. An O(nm) time algorithm for finding the min length directed cycle in a graph

    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

  3. Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach

    Computers and Operations Research, Vol. 82, pp. 153-166

2016

  1. Ranking One Million Simple Paths in Road Networks

    Asia-Pacific Journal of Operational Research, Vol. 33, Núm. 5

2015

  1. A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem

    Computers and Operations Research, Vol. 57, pp. 83-94

  2. A software application to optimize the visits of sales/marketing agents to their customers in a brewing company

    Advanced Business Analytics (Springer International Publishing), pp. 225-243

  3. An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem

    Applied Mathematics and Computation, Vol. 265, pp. 602-618

  4. Design and evaluation of ANR algorithm for LTE real scenario with high interference

    Electronics Letters, Vol. 51, Núm. 24, pp. 2057-2058