Network pricing problem with unit toll

DOI10.1002/NET.21701MaRDI QIDQ4565773zbMATH OpenOpenAlexFDO

Authors Lorenzo Castelli, Martine Labbé, Alessia Violin

Publication date 13 June 2018

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.21701

zbMATH Keywords

robustnetworkspricingpolynomialbilevelunit toll

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Network flow problems with pricing decisions
• Pricing traffic in a spanning network
• Tariff optimization in networks
• scientific article; zbMATH DE number 1086905
• A Competitive Network Design Problem with Pricing
• An optimal scheme for toll pricing problem
• Computing network tolls with support constraints
• A polyhedral study of the network pricing problem with connected toll arcs
• Optimization of limited network capacity with toll settings

Cited in

(5)

• A stronger lower bound on parametric minimum spanning trees
• A stronger lower bound on parametric minimum spanning trees
• A polyhedral study of the network pricing problem with connected toll arcs
• A survey on mixed-integer programming techniques in bilevel optimization
• Network pricing: how to induce optimal flows under strategic link operators

This page was built for publication: Network pricing problem with unit toll

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