EnglishSvenskaNorsk
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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 Lagrangean heuristic for the capacitated concave minimum cost network flow problem
Department of Mathematics, Institute of Technology, Linköping University.
Department of Mathematics, Institute of Technology, Linköping University.ORCID iD: 0000-0001-8473-3663
Department of Mathematics, Institute of Technology, Linköping University.
1989 (English)Report (Other academic)
Place, publisher, year, edition, pages
Linköping: Department of Mathematics, Universitetet i Linköping , 1989. , p. 22
Series
LiTH-MAT-R, ISSN 0348-2960 ; 89:23
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
URN: urn:nbn:se:ltu:diva-22892Local ID: 4b4b534d-2b27-47d8-8bb6-7f19e74b87bdOAI: oai:DiVA.org:ltu-22892DiVA, id: diva2:995941
Note
Upprättat; 1989; 20151001 (andbra)Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2025-10-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records

Migdalas, Athanasios

Search in DiVA

By author/editor
Migdalas, Athanasios
Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
|
Researcher: Register
|
Student: Register
|
Contact
|
WCAG