Feasibility in transportation networks with supply eating arcs

DOI<165::AID-NET3>3.0.CO;2-D 10.1002/(SICI)1097-0037(199805)31:3<165::AID-NET3>3.0.CO;2-DzbMath1002.90006OpenAlexW2043602306MaRDI QIDQ4540044

Asgeir Tomasgard, Shane Dye, Stein W. Wallace

Publication date: 21 July 2002

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199805)31:3<165::aid-net3>3.0.co;2-d

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Related Items

Approximation algorithms and relaxations for a service provision problem on a telecommunication network