scientific article; zbMATH DE number 3347910
From MaRDI portal
Publication:5623510
zbMath0218.90035MaRDI QIDQ5623510
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (16)
Bilevel programming in traffic planning: Models, methods and challenge ⋮ Modifying link capacity to avoid Braess paradox considering elastic demand ⋮ Navigation system-based routing strategies in traffic flows on networks ⋮ Computational models of chemical systems inspired by Braess' paradox ⋮ On the Microscopic Modeling of Vehicular Traffic on General Networks ⋮ Homogenization of second order discrete model with local perturbation and application to traffic flow ⋮ Anregungen aus dem Schnittebenenverfahren für die Lösung des allgemeinen Transportproblems ⋮ From Heterogeneous Microscopic Traffic Flow Models to Macroscopic Models ⋮ Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator) ⋮ Flüsse in antisymmetrischen Netzwerken. (Flows in anti-symmetric networks.) ⋮ Die Bestimmung kürzester Pfade in Graphen und passende Datenstrukturen ⋮ Ein Algorithmus zur Ermittlung k-bester Kantenfolgen zwischen allen Ecken eines Graphen ⋮ The Braess paradox ⋮ Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen ⋮ Eine strenge Begründung dynamischer Programme und die Bestimmung ausgezeichneter Knoten- oder Kantenmengen in endlichen Graphen ⋮ On the Braess paradox with nonlinear dynamics and control theory
This page was built for publication:
