Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

A New Necessary Condition for Shortest Path Routing

In English

Författare

  • Mats Petter Wallander
  • Krzysztof Kuchcinski

Summary, in English

In shortest path routing, traffic is routed along shortest paths defined by link weights. However, not all path systems are feasible in that they can be realized in this way. This is something which needs to be taken into account when searching for a set of paths that minimize capacity consumption. In this paper, we discuss a new necessary condition that can be used during search to prune infeasible path systems. The condition can be expressed using linear inequalities, or used in constraint programming, where its simple definition is convenient for the efficient implementation of propagation. Experiments on networks from the SNDLib benchmark show that this condition has strong pruning capabilities

Publiceringsår

2007

Språk

Engelska

Sidor

195-204

Publikation/Tidskrift/Serie

Network Control and Optimization (Lecture notes in computer science)

Volym

4465

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Computer Science

Conference name

First EuroFGI International Conference, NET-COOP 2007

Conference date

2007-07-05 - 2007-07-07

Conference place

Avignon, France

Status

Published

Forskningsgrupp

  • ESDLAB

ISBN/ISSN/Övrigt

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-72708-8