Bounds on penalties for dummy arcs in transportation networks

DOI10.1016/0377-2217(88)90128-2zbMath0666.90033OpenAlexW1998150035MaRDI QIDQ1117136

Hanif D. Sherali

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90128-2

zbMATH Keywords

resource allocationtransportation networksdummy transportation arcs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Preemptive and nonpreemptive multi-objective programming: Relationships and counterexamples
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• Decomposition Principle for Linear Programs

This page was built for publication: Bounds on penalties for dummy arcs in transportation networks