Similar Search Results

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

Ruiz, Efrain; Albareda-Sambola, Maria; Fernández, Elena; … - In: Computers & operations research : and their … 57 (2015), pp. 95-108

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

An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions

Pinto, Leizer Lima; Laporte, Gilbert - In: European journal of operational research : EJOR 207 (2010) 1, pp. 45-49

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

Locating replenishment stations for electric vehicles : application to Danish traffic data

Wen, Min; Laporte, Gilbert; Madsen, Oli B.; Nørrelund, … - In: Journal of the Operational Research Society : OR 65 (2014) 10, pp. 1555-1561

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

Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs

Wøhlk, Sanne; Laporte, Gilbert - In: Computers & operations research : and their … 87 (2017), pp. 107-113

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

A branch-and-cut algorithm for the minimum branch vertices spanning tree problem

Silvestri, Selene; Laporte, Gilbert; Cerulli, Raffaele - In: Computers & operations research : and their … 81 (2017), pp. 322-332

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

Reformulated acyclic partitioning for rail-rail containers transshipment

Albareda-Sambola, Maria; Marín, Alfredo; … - In: European journal of operational research : EJOR 277 (2019) 1, pp. 153-165

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

The maximum dispersion problem

Fernández, Elena; Kalcsics, Jörg; Nickel, Stefan - In: Omega 41 (2013) 4, pp. 721-730

In the maximum dispersion problem, a given set of objects has to be partitioned into a number of groups. Each object has a non-negative weight and each group has a target weight, which may be different for each group. In addition to meeting the target weight of each group, all objects assigned...

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

Lagrangean bounds for the optimum communication spanning tree problem

Contreras, Ivan; Fernández, Elena; Marín, Alfredo - In: Top : transactions in operations research 18 (2010) 1, pp. 140-157

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

Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem

Fernández, Elena; Pozo, Miguel A.; Puerto, Justo; … - In: European journal of operational research : EJOR 260 (2017) 3, pp. 886-903

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

Minimum Spanning Trees with neighborhoods : mathematical programming formulations and solution methods

Blanco, Víctor; Fernández, Elena; Puerto, Justo - In: European journal of operational research : EJOR 262 (2017) 3, pp. 863-878

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