Similar Search Results

Spanning trees with a constraint on the number of leaves. A new formulation

Gouveia, Luis; Simonetti, Luidi - In: Computers & operations research : and their … 81 (2017), pp. 257-268

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

Unilateral and multilateral sanctions : a network approach

Joshi, Sumit; Mahmud, Ahmed Saber - In: Journal of economic behavior & organization : JEBO 145 (2018), pp. 52-65

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

Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem

Guimarães, Dilson Almeida; Cunha, Alexandre Salles da; … - In: European journal of operational research : EJOR 280 (2020) 1, pp. 46-58

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

Sanctions in networks: "the most unkindest cut of all"

Joshi, Sumit; Mahmud, Ahmed Saber - In: Games and economic behavior 97 (2016), pp. 44-53

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

The mathematical equivalence of the "spanning tree" and row geometric mean preference vectors and its implications for preference analysis

Lundy, Michele; Siraj, Sajid; Greco, Salvatore - In: European journal of operational research : EJOR 257 (2017) 1, pp. 197-208

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

New inconsistency indicators for incomplete pairwise comparisons matrices

Szybowski, Jacek; Kułakowski, Konrad; Prusak, Anna - In: Mathematical social sciences 108 (2020), pp. 138-145

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

Solving the optimum communication spanning tree problem

Zetina, Carlos Armando; Contreras, Ivan; Fernández, Elena - In: European journal of operational research : EJOR 273 (2019) 1, pp. 108-117

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

Modeling and solving the bi-objective minimum diameter-cost spanning tree problem

Santos, Andréa; Lima, Diego; Aloise, Dario - In: Journal of Global Optimization 60 (2014) 2, pp. 195-216

The bi-objective minimum diameter-cost spanning tree problem (bi-MDCST) seeks spanning trees with minimum total cost and minimum diameter. The bi-objective version generalizes the well-known bounded diameter minimum spanning tree problem. The bi-MDCST is a NP-hard problem and models several...

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

A hybrid heuristic for the diameter constrained minimum spanning tree problem

Lucena, Abilio; Ribeiro, Celso; Santos, Andréa - In: Journal of Global Optimization 46 (2010) 3, pp. 363-381

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

The facets of the spanning trees polytope

Chaourar, Brahim - In: Mathematical methods of operations research : ZOR 96 (2022) 1, pp. 113-121

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