A polyhedral study of the network pricing problem with connected toll arcs

DOI10.1002/NET.20368MaRDI QIDQ3057150zbMATH OpenOpenAlexFDO

Authors Géraldine Heilporn, Martine Labbé, Gilles Savard, P. Marcotte

Publication date 24 November 2010

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

bilevel programmingcombinatorial optimizationnetwork pricing

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• New formulations and valid inequalities for a bilevel pricing problem
• Valid inequalities and branch-and-cut for the clique pricing problem
• An approximation algorithm for Stackelberg network pricing
• Network pricing problem with unit toll
• Computing network tolls with support constraints

Cites work

• A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network
• An approximation algorithm for Stackelberg network pricing
• An overview of bilevel optimization
• Maximum utility product pricing models and algorithms based on reservation price
• New formulations and valid inequalities for a bilevel pricing problem
• On profit-maximizing envy-free pricing
• Optimal product design using conjoint analysis: Computational complexity and algorithms
• Tariff optimization in networks

Cited in

(17)

• Bounds on penalties for dummy arcs in transportation networks
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Bilevel road pricing: theoretical analysis and optimality conditions
• The hub location and pricing problem
• Competitive location and pricing on a line with metric transportation costs
• On a stochastic bilevel programming problem
• The envy-free pricing problem and unit-demand markets
• Efficient heuristic algorithms for maximum utility product pricing problems
• Network pricing problem with unit toll
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A Catalog of Formulations for the Network Pricing Problem
• Bilevel programming and price setting problems
• Bilevel programming and price setting problems
• A survey on mixed-integer programming techniques in bilevel optimization
• Valid inequalities and branch-and-cut for the clique pricing problem
• Regulating the rebound effect in the traveling purchaser problem
• New formulations and valid inequalities for a bilevel pricing problem

This page was built for publication: A polyhedral study of the network pricing problem with connected toll arcs

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