A dual framework for time-variant network decision problems

MaRDI QIDQ3635591zbMATH OpenFDO

Authors Teodros Getachew, Gregory L. Light

Publication date 6 July 2009

zbMATH Keywords

network flowsshortest pathsnetwork representationspartially ordered optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Time-varying network optimization.
• scientific article; zbMATH DE number 934458
• A Generalization of Dynamic Programming for Pareto Optimization in Dynamic Networks
• Dynamic flows in time-varying networks.
• Some dynamic time-optimality problems on networks with allocation of several resource types

Cited in

(2)

• Temporal network optimization subject to connectivity constraints
• Networked timetable stability improvement based on a bilevel optimization programming model

This page was built for publication: A dual framework for time-variant network decision problems

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