A polyhedral approach to the generalized minimum labeling spanning tree problem

A polyhedral approach to the generalized minimum labeling spanning tree problem EURO J Comput Optim https://doi.org/10.1007/s13675-018-0099-5 ORIGINAL PAPER A polyhedral approach to the generalized minimum labeling spanning tree problem 1,2,3 3 Thiago Gouveia da Silva · Serigne Gueye · 3 2 Philippe Michelon · Luiz Satoru Ochi · Lucídio dos Anjos Formiga Cabral Received: 16 May 2017 / Accepted: 25 May 2018 © Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018 Abstract The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels. It is an NP- hard problem that was introduced by Chang and Leu (Inf Process Lett 63(5):277–282, 1997. https://doi.org/10.1016/S0020-0190(97)00127-0). Chen et al. (Comparison of heuristics for solving the gmlst problem, in: Raghavan, Golden, Wasil (eds) Telecom- munications modeling, policy, and technology, Springer, Boston, pp 191–217, 2008) subsequently proposed a generalization of the MLSTP, called the generalized min- imum labeling spanning tree problem (GMLSTP), that allows a situation in which multiple labels can be assigned to an edge. Here, we show how the GMLSTP can be expressed as an MLSTP in http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png EURO Journal on Computational Optimization Springer Journals

A polyhedral approach to the generalized minimum labeling spanning tree problem

Loading next page...
 
/lp/springer_journal/a-polyhedral-approach-to-the-generalized-minimum-labeling-spanning-6VAfhwNvGa
Publisher
Springer Berlin Heidelberg
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies
Subject
Business and Management; Operations Research/Decision Theory; Operations Management; Operations Research, Management Science; Optimization
ISSN
2192-4406
eISSN
2192-4414
D.O.I.
10.1007/s13675-018-0099-5
Publisher site
See Article on Publisher Site

Abstract

EURO J Comput Optim https://doi.org/10.1007/s13675-018-0099-5 ORIGINAL PAPER A polyhedral approach to the generalized minimum labeling spanning tree problem 1,2,3 3 Thiago Gouveia da Silva · Serigne Gueye · 3 2 Philippe Michelon · Luiz Satoru Ochi · Lucídio dos Anjos Formiga Cabral Received: 16 May 2017 / Accepted: 25 May 2018 © Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018 Abstract The minimum labeling spanning tree problem (MLSTP) is a combinatorial optimization problem that consists in finding a spanning tree in a simple graph G, in which each edge has one label, by using a minimum number of labels. It is an NP- hard problem that was introduced by Chang and Leu (Inf Process Lett 63(5):277–282, 1997. https://doi.org/10.1016/S0020-0190(97)00127-0). Chen et al. (Comparison of heuristics for solving the gmlst problem, in: Raghavan, Golden, Wasil (eds) Telecom- munications modeling, policy, and technology, Springer, Boston, pp 191–217, 2008) subsequently proposed a generalization of the MLSTP, called the generalized min- imum labeling spanning tree problem (GMLSTP), that allows a situation in which multiple labels can be assigned to an edge. Here, we show how the GMLSTP can be expressed as an MLSTP in

Journal

EURO Journal on Computational OptimizationSpringer Journals

Published: Jun 4, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off