liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A strong lower bound for the node weighted Steiner tree problem
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .
Linköping University, The Institute of Technology. Linköping University, Department of Science and Technology.
1998 (English)In: Networks, ISSN 0028-3045, Vol. 31, 11-17 p.Article in journal (Refereed) Published
Place, publisher, year, edition, pages
1998. Vol. 31, 11-17 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:liu:diva-32504Local ID: 18411OAI: oai:DiVA.org:liu-32504DiVA: diva2:253326
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2011-01-14

Open Access in DiVA

No full text

Authority records BETA

Göthe-Lundgren, MaudVärbrand, Peter

Search in DiVA

By author/editor
Göthe-Lundgren, MaudVärbrand, Peter
By organisation
The Institute of TechnologyOptimization Department of Science and Technology
In the same journal
Networks
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 355 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf