z-logo
open-access-imgOpen Access
A polyhedral approach to the generalized minimum labeling spanning tree problem
Author(s) -
ThiagoGouveiada Silva,
Serigne Guèye,
Philippe Michelon,
LuizSatoru Ochi,
LucídiodosAnjosFormiga Cabral
Publication year - 2018
Publication title -
euro journal on computational optimization
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.95
H-Index - 14
eISSN - 2192-4414
pISSN - 2192-4406
DOI - 10.1007/s13675-018-0099-5
Subject(s) - spanning tree , minimum spanning tree , polytope , heuristics , cutting plane method , integer programming , combinatorics , minimum degree spanning tree , linear programming relaxation , mathematics , generalization , combinatorial optimization , binary tree , computer science , mathematical optimization , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom