New Dynamic Programming algorithm for the Multiobjective Minimum Spanning Tree problem.
Comput. Oper. Res., 2025
A bi-objective optimization model to decide the lines attending a bus-stop with high passenger demands.
Comput. Ind. Eng., December, 2023
Targeted multiobjective Dijkstra algorithm.
Networks, October, 2023
K-Shortest Simple Paths Using Biobjective Path Search.
CoRR, 2023
Multiobjective Dijkstra A.
CoRR, 2021
An Improved Multiobjective Shortest Path Algorithm.
Comput. Oper. Res., 2021
An FPTAS for Dynamic Multiobjective Shortest Path Problems.
Algorithms, 2021
A biobjective Dijkstra algorithm.
Eur. J. Oper. Res., 2019
Finding extreme supported solutions of biobjective network flow problems: An enhanced parametric programming approach.
Comput. Oper. Res., 2017
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, 2017
Ranking One Million Simple Paths in Road Networks.
Asia Pac. J. Oper. Res., 2016
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem.
Comput. Oper. Res., 2015
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem.
Appl. Math. Comput., 2015
Fast and fine quickest path algorithm.
Eur. J. Oper. Res., 2014
On the second point-to-point undirected shortest simple path problem.
Optim. Lett., 2013
On the K best integer network flows.
Comput. Oper. Res., 2013
Enumerating K best paths in length order in DAGs.
Eur. J. Oper. Res., 2012
An efficient label setting/correcting shortest path algorithm.
Comput. Optim. Appl., 2012
An efficient time and space K point-to-point shortest simple paths algorithm.
Appl. Math. Comput., 2012
On the K shortest path trees problem.
Eur. J. Oper. Res., 2010
A new strategy for the undirected two-commodity maximum flow problem.
Comput. Optim. Appl., 2010
Shortest Path Simplex Algorithm with a Multiple Pivot Rule: a Comparative Study.
Asia Pac. J. Oper. Res., 2010
A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows.
Eur. J. Oper. Res., 2009
Preemptive benchmarking problem: An approach for official statistics in small areas.
Eur. J. Oper. Res., 2009
Optimality conditions in preference-based spanning tree problems.
Eur. J. Oper. Res., 2009
New efficient shortest path simplex algorithm: pseudo permanent labels instead of permanent labels.
Comput. Optim. Appl., 2009
An efficient approach for solving the lot-sizing problem with time-varying storage capacities.
Eur. J. Oper. Res., 2008
A polynomial algorithm for the production/ordering planning problem with limited storage.
Comput. Oper. Res., 2007
Network flow approaches to pre-emptive open-shop scheduling problems with time-windows.
Eur. J. Oper. Res., 2006
Solving the undirected minimum cost flow problem with arbitrary costs.
Networks, 2005
The biobjective undirected two-commodity minimum cost flow problem.
Eur. J. Oper. Res., 2005
A generalization of the scaling max-flow algorithm.
Comput. Oper. Res., 2004
An <i>O</i>(<i>T</i> log <i>T</i>) Algorithm for the Dynamic Lot Size Problem with Limited Storage and Linear Costs.
Comput. Optim. Appl., 2004
A new characterization for the dynamic lot size problem with bounded inventory.
Comput. Oper. Res., 2003
An algorithm for the biobjective integer minimum cost flow problem.
Comput. Oper. Res., 2001
The biobjective minimum cost flow problem.
Eur. J. Oper. Res., 2000