scientific article

zbMATH Open0574.90028MaRDI QIDQ3693222

Les R. Foulds

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

branch-and-boundrelaxationcongestionnetwork designroad networkBraess' paradoxarc eliminationuser-optimal flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (2)

Bounds on penalties for dummy arcs in transportation networks ⋮ Removing null branches in a transfinite network

This page was built for publication:

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