The following pages link to Marta M. B. Pascoal (Q279253):
Displaying 32 items.
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- Path based algorithms for metro network design (Q337631) (← links)
- Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
- (Q591637) (redirect page) (← links)
- Minimum cost path problems with relays (Q709122) (← links)
- Internet packet routing: application of a \(K\)-quickest path algorithm (Q877587) (← links)
- (Q926596) (redirect page) (← links)
- Computational experiments with a lazy version of a \(K\) quickest simple path ranking algorithm (Q926599) (← links)
- On algorithms for the tricriteria shortest path problem with two bottleneck objective functions (Q976042) (← links)
- Finding non-dominated bicriteria shortest pairs of disjoint simple paths (Q1025230) (← links)
- A mixed integer linear formulation for the minimum label spanning tree problem (Q1025265) (← links)
- A note on a new variant of Murty's ranking assignments algorithm (Q1416101) (← links)
- A new implementation of Yen's ranking loopless paths algorithm (Q1432016) (← links)
- Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios (Q1751178) (← links)
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (Q1761116) (← links)
- An algorithm for ranking quickest simple paths (Q1886854) (← links)
- Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
- Optimising a cascade of hydro-electric power stations (Q1979736) (← links)
- Modeling bimaterial 3D printing using galvanometer mirror scanners (Q1982686) (← links)
- The rough interval shortest path problem (Q2089442) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- Bimaterial 3D printing using galvanometer scanners (Q2303520) (← links)
- A comprehensive survey on the quickest path problem (Q2379862) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
- A bicriterion approach for routing problems in multimedia networks (Q4419277) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS (Q5249002) (← links)
- (Q5415220) (← links)
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs (Q5879665) (← links)
- On a relaxed maximally disjoint path pair problem: a bicriteria approach (Q6069837) (← links)
- Finding shortest and dissimilar paths (Q6071084) (← links)
