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

Direct link
Cite
Citation style
  • apa
  • 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
The Prize Collecting Connected Subgraph Problem - A New NP-Hard Problem arizing in Snow Removal Routing
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 Mathematics, Optimization .
2004 (English)In: Operations Research 2004,2004, Berlin: Springer , 2004Conference paper, Published paper (Refereed)
Place, publisher, year, edition, pages
Berlin: Springer , 2004.
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-24197Local ID: 3789OAI: oai:DiVA.org:liu-24197DiVA, id: diva2:244514
Available from: 2009-10-07 Created: 2009-10-07

Open Access in DiVA

No full text in DiVA

Authority records

Razmara, GholamrezaLindberg, Per Olov

Search in DiVA

By author/editor
Razmara, GholamrezaLindberg, Per Olov
By organisation
The Institute of TechnologyOptimization
Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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
v. 2.47.0
|
Accessibility
|
DiVA portal
|
DiVA Log in
|
Contact us
|
LiU University Library
|
SwePub
|
Uppsök