View in EDS

A Lagrangean heuristic for the capacitated concave minimum cost network flow problem.

Saved in:
Bibliographic Details
Title: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem.
Authors: Larsson, Torbjörn, Migdalas, Athanasios, Rönnqvist, Mikael
Source: European Journal of Operational Research. 10/13/1994, Vol. 78 Issue 1, p116-129. 14p. 1 Chart, 4 Graphs.
Subjects: Network analysis (Planning), Lagrange equations, Mathematical optimization
Abstract: We propose a heuristic solution technique for the capacitated concave minimum cost network flow problem based on a Lagrangean dualization of the problem. Despite its dual character the algorithm guarantees the generation of primal feasible solutions which are local optima and therefore candidates of being the global optimum. The Lagrangean dual is solved by a subgradient search procedure and provides a lower bound to the optimal value. The lower bound is, in general, stronger than the one obtained by a linear approximation of the original problem. It can be used as a judgement of the quality of the solution or in a branch and bound procedure. Computational results from randomly generated problems are presented. [ABSTRACT FROM AUTHOR]
Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 8501122
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Larsson%2C+Torbjörn%22">Larsson, Torbjörn</searchLink><br /><searchLink fieldCode="AR" term="%22Migdalas%2C+Athanasios%22">Migdalas, Athanasios</searchLink><br /><searchLink fieldCode="AR" term="%22Rönnqvist%2C+Mikael%22">Rönnqvist, Mikael</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22European+Journal+of+Operational+Research%22">European Journal of Operational Research</searchLink>. 10/13/1994, Vol. 78 Issue 1, p116-129. 14p. 1 Chart, 4 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Network+analysis+%28Planning%29%22">Network analysis (Planning)</searchLink><br /><searchLink fieldCode="DE" term="%22Lagrange+equations%22">Lagrange equations</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+optimization%22">Mathematical optimization</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We propose a heuristic solution technique for the capacitated concave minimum cost network flow problem based on a Lagrangean dualization of the problem. Despite its dual character the algorithm guarantees the generation of primal feasible solutions which are local optima and therefore candidates of being the global optimum. The Lagrangean dual is solved by a subgradient search procedure and provides a lower bound to the optimal value. The lower bound is, in general, stronger than the one obtained by a linear approximation of the original problem. It can be used as a judgement of the quality of the solution or in a branch and bound procedure. Computational results from randomly generated problems are presented. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of European Journal of Operational Research is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=8501122
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/0377-2217(94)90126-0
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 116
    Subjects:
      – SubjectFull: Network analysis (Planning)
        Type: general
      – SubjectFull: Lagrange equations
        Type: general
      – SubjectFull: Mathematical optimization
        Type: general
    Titles:
      – TitleFull: A Lagrangean heuristic for the capacitated concave minimum cost network flow problem.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Larsson, Torbjörn
      – PersonEntity:
          Name:
            NameFull: Migdalas, Athanasios
      – PersonEntity:
          Name:
            NameFull: Rönnqvist, Mikael
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 13
              M: 10
              Text: 10/13/1994
              Type: published
              Y: 1994
          Identifiers:
            – Type: issn-print
              Value: 03772217
          Numbering:
            – Type: volume
              Value: 78
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: European Journal of Operational Research
              Type: main
ResultId 1