L'affectation exponentielle et le problème du plus court chemin dans un graphe

DOI10.1051/RO/1981150201651zbMATH Open0457.90078OpenAlexW2587727614MaRDI QIDQ3907433FDOQ3907433

Authors: Jean Fonlupt 

Publication date: 1981

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/104784

zbMATH Keywords

graphsshortest path problemtransportationentropy functionpenalty functionroad networktraffictraffic assignmentsystems of linear equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35) Iterative numerical methods for linear systems (65F10)

This page was built for publication: L'affectation exponentielle et le problème du plus court chemin dans un graphe

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3907433)