Similar Search Results

Uniform multicommodity flow through the complete graph with random edge-capacities

Aldous, David J.; McDiarmid, Colin; Scott, Alex - In: Operations research letters 37 (2009) 5, pp. 299-302

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

Operations research proceedings 1999 : selected papers of the Symposium on Operations Research (SOR '99), Magdeburg, September 1 - 3, 1999

Inderfurth, Karl (ed.) - 2000

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

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

A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : a mixed graph coloring approach

Kouider, Ahmed; Ait Haddadène, Hacène - In: Computers & operations research : and their … 132 (2021), pp. 1-13

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

The Ordered Median Tree Location Problem

Pozo, Miguel A.; Puerto, Justo; Torrejón, Alberto - In: Computers & operations research : an international journal 169 (2024), pp. 1-18

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

Original optimal method to solve the all-pairs shortest path problem: Dhouib-matrix-ALL-SPP

Dhouib, Souhail - In: Data science and management : DSM 7 (2024) 3, pp. 206-217

The All-pairs shortest path problem (ALL-SPP) aims to find the shortest path joining all the vertices in a given graph. This study proposed a new optimal method, Dhouib-matrix-ALL-SPP (DM-ALL-SPP) to solve the ALL-SPP based on column-row navigation through the adjacency matrix. DM-ALL-SPP is...

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