• DocumentCode
    1027502
  • Title

    Variable reduction method in routing problems

  • Author

    Pavlidou, F. ; Kouris, S.S.

  • Author_Institution
    University of Thessaloniki, Electrical Engineering Department, Thessaloniki, Greece
  • Volume
    22
  • Issue
    22
  • fYear
    1986
  • Firstpage
    1202
  • Lastpage
    1203
  • Abstract
    A variable reduction method is used in the mathematical formulation of routing problems where independent variables obey linear constraints. In this respect the first and second derivatives of the reduced objective function are evaluated. The Hessian matrix results are diagonal and therefore Newton´s method can easily be applied.
  • Keywords
    computer networks; network topology; switching theory; Hessian matrix; Newton´s method; communication theory; computer networks; objective function; routeing algorithm; routing problems; topology; variable reduction method;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19860823
  • Filename
    4257041
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1027502