| Publication | Date of Publication | Type |
|---|
Targeted multiobjective Dijkstra algorithm
Networks | 2023-12-18 | Paper |
Solving a constrained economic lot size problem by ranking efficient production policies
Journal of Industrial and Management Optimization | 2022-08-23 | Paper |
An improved multiobjective shortest path algorithm
Computers & Operations Research | 2022-03-09 | Paper |
A biobjective Dijkstra algorithm
European Journal of Operational Research | 2019-02-25 | Paper |
An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem
Applied Mathematics and Computation | 2018-08-24 | Paper |
An \(O(nm)\) time algorithm for finding the min length directed cycle in a graph
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach
Computers & Operations Research | 2018-07-11 | Paper |
Ranking One Million Simple Paths in Road Networks
Asia-Pacific Journal of Operational Research | 2016-12-16 | Paper |
On the \(K\) best integer network flows
Computers & Operations Research | 2016-11-14 | Paper |
A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem
Computers & Operations Research | 2016-11-10 | Paper |
Fast and fine quickest path algorithm
European Journal of Operational Research | 2016-06-23 | Paper |
On the second point-to-point undirected shortest simple path problem
Optimization Letters | 2014-01-30 | Paper |
Enumerating \(K\) best paths in length order in DAGs
European Journal of Operational Research | 2012-12-29 | Paper |
An efficient time and space \(K\) point-to-point shortest simple paths algorithm
Applied Mathematics and Computation | 2012-08-30 | Paper |
An efficient label setting/correcting shortest path algorithm
Computational Optimization and Applications | 2012-07-10 | Paper |
On the \(K\) shortest path trees problem
European Journal of Operational Research | 2009-11-27 | Paper |
Optimality conditions in preference-based spanning tree problems
European Journal of Operational Research | 2009-06-30 | Paper |
An efficient approach for solving the lot-sizing problem with time-varying storage capacities
European Journal of Operational Research | 2008-04-24 | Paper |
A polynomial algorithm for the production/ordering planning problem with limited storage
Computers & Operations Research | 2006-12-07 | Paper |
| scientific article; zbMATH DE number 2163908 (Why is no real title available?) | 2005-05-03 | Paper |
An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
Computational Optimization and Applications | 2004-11-22 | Paper |
A generalization of the scaling max-flow algorithm
Computers & Operations Research | 2004-11-12 | Paper |
| scientific article; zbMATH DE number 1869742 (Why is no real title available?) | 2003-06-02 | Paper |
A new characterization for the dynamic lot size problem with bounded inventory
Computers & Operations Research | 2003-04-28 | Paper |
| AO(nm log(U/n)) time maximum flow algorithm | 2002-01-27 | Paper |
