| Publication | Date of Publication | Type |
|---|
Finding shortest and dissimilar paths
International Transactions in Operational Research | 2023-11-27 | Paper |
On a relaxed maximally disjoint path pair problem: a bicriteria approach
International Transactions in Operational Research | 2023-11-17 | Paper |
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
INFOR: Information Systems and Operational Research | 2023-09-05 | Paper |
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
INFOR: Information Systems and Operational Research | 2023-03-02 | Paper |
The rough interval shortest path problem
| 2022-10-22 | Paper |
Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
Computers & Operations Research | 2022-09-27 | Paper |
An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
Top | 2022-06-16 | Paper |
Finding $K$ dissimilar paths using integer linear formulations
| 2021-09-19 | Paper |
Modeling bimaterial 3D printing using galvanometer mirror scanners
| 2021-09-14 | Paper |
Optimising a cascade of hydro-electric power stations
| 2021-09-03 | Paper |
Bimaterial 3D printing using galvanometer scanners
Optimization and Engineering | 2020-03-04 | Paper |
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
Discrete Optimization | 2018-05-24 | Paper |
Path based algorithms for metro network design
Computers & Operations Research | 2016-11-10 | Paper |
The minmax regret robust shortest path problem in a finite multi-scenario model
Applied Mathematics and Computation | 2016-04-27 | Paper |
Deviation algorithms for ranking shortest paths
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
scientific article; zbMATH DE number 6293695 (Why is no real title available?)
| 2014-05-12 | Paper |
Bicriteria path problem minimizing the cost and minimizing the number of labels
4OR | 2013-12-02 | Paper |
Multicriteria path and tree problems: discussion on exact algorithms and applications
International Transactions in Operational Research | 2013-04-24 | Paper |
Enumerating \(K\) best paths in length order in DAGs
European Journal of Operational Research | 2012-12-29 | Paper |
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
Computers & Operations Research | 2012-11-15 | Paper |
Minimum cost path problems with relays
Computers & Operations Research | 2010-10-15 | Paper |
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
Computers & Operations Research | 2010-06-11 | Paper |
A comprehensive survey on the quickest path problem
Annals of Operations Research | 2010-03-23 | Paper |
On the bicriterion - minimal cost/minimal label - spanning tree problem
European Journal of Operational Research | 2010-01-25 | Paper |
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
Computers & Operations Research | 2009-06-18 | Paper |
A mixed integer linear formulation for the minimum label spanning tree problem
Computers & Operations Research | 2009-06-18 | Paper |
Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm
Top | 2008-05-20 | Paper |
Internet packet routing: application of a \(K\)-quickest path algorithm
European Journal of Operational Research | 2007-05-03 | Paper |
An algorithm for ranking quickest simple paths
Computers & Operations Research | 2004-11-19 | Paper |
A new implementation of Yen's ranking loopless paths algorithm
4OR | 2004-06-11 | Paper |
A bicriterion approach for routing problems in multimedia networks
Networks | 2003-07-31 | Paper |
A note on a new variant of Murty's ranking assignments algorithm
4OR | 2003-01-01 | Paper |
