An Unified Approach to Find an Optimal Parameterized Path in a Digraph with Multiple Features - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

An Unified Approach to Find an Optimal Parameterized Path in a Digraph with Multiple Features

Abstract

This paper is devoted to a class of problems which are modeled by a digraph, and such that each arc is characterized by several weights which depend on a parameter. This parameter takes its values in a set which characterizes the arc. The goal is to find a so-called parameterized path (i.e; a path and the values of the parameters corresponding to its arcs) that optimizes a criterion which is a combination of the weights of the arcs. The problem is introduced using transportation, communication and manufacturing problems. An unified formulation is provided, as well as an algorithm. A numerical example is proposed to illustrate this algorithm.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3745.pdf (680.99 Ko) Télécharger le fichier

Dates and versions

inria-00072917 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072917 , version 1

Cite

Nikolai Guschinsky, Genrikh Levin, Jean-Marie Proth. An Unified Approach to Find an Optimal Parameterized Path in a Digraph with Multiple Features. [Research Report] RR-3745, INRIA. 1999, pp.16. ⟨inria-00072917⟩
94 View
20 Download

Share

Gmail Facebook X LinkedIn More