Skip to Main content Skip to Navigation
Reports

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072917
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:16:37 AM
Last modification on : Thursday, February 11, 2021 - 2:48:12 PM
Long-term archiving on: : Thursday, March 24, 2011 - 12:20:39 PM

Identifiers

  • HAL Id : inria-00072917, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

243

Files downloads

71