Similar Search Results

An efficient label setting/correcting shortest path algorithm

Sedeño-Noda, Antonio; González-Martín, Carlos - In: Computational Optimization and Applications 51 (2012) 1, pp. 437-455

Persistent link: https://www.econbiz.de/10010998286

On the K shortest path trees problem

Sedeño-Noda, Antonio; González-Martín, Carlos - In: European Journal of Operational Research 202 (2010) 3, pp. 628-635

We address the problem of finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k-1) shortest path...

Persistent link: https://www.econbiz.de/10008483246

Optimality conditions in preference-based spanning tree problems

Alonso, Sergio; Domínguez-Ríos, Miguel Ángel; … - In: European journal of operational research : EJOR 198 (2009) 1, pp. 232-240

Persistent link: https://www.econbiz.de/10003853581

On the K shortest path trees problem

Sedeño-Noda, Antonio; González Martínez, Carlos - In: European journal of operational research : EJOR 202 (2010) 3, pp. 628-635

Persistent link: https://www.econbiz.de/10003976093

Enumerating K best paths in length order in DAGs

Pascoal, Marta M. B.; Sedeño-Noda, Antonio - In: European journal of operational research : EJOR 221 (2012) 2, pp. 308-316

Persistent link: https://www.econbiz.de/10009557694

On the K best integer network flows

Sedeño-Noda, Antonio; Espino-Martín, Juan José - In: Computers & operations research : and their … 40 (2013) 2, pp. 616-626

Persistent link: https://www.econbiz.de/10009661144

Fast and fine quickest path algorithm

Sedeño-Noda, Antonio; González-Barrera, Jonathan D. - In: European journal of operational research : EJOR 238 (2014) 2, pp. 596-606

Persistent link: https://www.econbiz.de/10010400164

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

Sedeño-Noda, Antonio; Raith, Andrea - In: Computers & operations research : and their … 57 (2015), pp. 83-94

Persistent link: https://www.econbiz.de/10010495401

An improved multiobjective shortest path algorithm

Maristany de las Casas, Pedro; Sedeño-Noda, Antonio; … - In: Computers & operations research : and their … 135 (2021), pp. 1-14

Persistent link: https://www.econbiz.de/10012649725

Finding extreme supported solutions of biobjective network flow problems : an enhanced parametric programming approach

Raith, Andrea; Sedeño-Noda, Antonio - In: Computers & operations research : and their … 82 (2017), pp. 153-166

Persistent link: https://www.econbiz.de/10011674582