BIBLIOS

  Ciências References Management System

Visitor Mode (Login)
Need help?


Back

Publication details

Document type
Book chapters


Title
Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves

Participants in the publication
Luís Gouveia (Author)
CMAFcIO
João Telhada (Author)
CMAFcIO

Editor(s)
Pahl J., Reiners T., Voß S.

Date of Publication
2011

Institution
FACULDADE DE CIÊNCIAS DA UNIVERSIDADE DE LISBOA

Where published
Lecture Notes in Computer Science,Network Optimization

Publication Identifiers
ISBN - 9783642215261

Address
Berlin, Germany

Publisher
Springer Berlin Heidelberg

Collection
Lecture Notes in Computer Science

Edition
1st
Volume
6701

Number of pages
9
Starting page
83
Last page
91

Document Identifiers
DOI - https://doi.org/10.1007/978-3-642-21527-8_11
URL - http://dx.doi.org/10.1007/978-3-642-21527-8_11

Rankings
SCIMAGO Q3 (2022) - 0.25 - Computer Science


Export

APA
Luís Gouveia, João Telhada, (2011). Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves. Lecture Notes in Computer Science,Network Optimization, 83-91

IEEE
Luís Gouveia, João Telhada, "Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves" in Lecture Notes in Computer Science,Network Optimization, 2011, pp. 83-91

BIBTEX
@incollection{54577, author = {Luís Gouveia and João Telhada}, title = {Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves}, booktitle = {Lecture Notes in Computer Science,Network Optimization}, year = 2011, pages = {83-91}, address = {Berlin, Germany}, publisher = {Springer Berlin Heidelberg} }