activity
20042021
most citedAn Approximation Algorithm for Stackelberg Network Pricing

65 citations · 66 across the 4 of their papers we have counts for

collaborators

5 papers

math.OC2021★ 1 cited

A Two-step Heuristic for the Periodic Demand Estimation Problem

Greta Laage, Emma Frejinger, Gilles Savard

Freight carriers rely on tactical plans to satisfy demand in a cost-effective way. For computational tractability in real large-scale settings, such plans are typically computed by…

cs.LG2021

Periodic Freight Demand Estimation for Large-scale Tactical Planning

Greta Laage, Emma Frejinger, Gilles Savard

Freight carriers rely on tactical planning to design their service network to satisfy demand in a cost-effective way. For computational tractability, deterministic and cyclic Servi…

math.OC2018

Product-Closing Approximation for Ranking-based Choice Network Revenue Management

Thibault Barbier, Miguel Anjos, Fabien Cirinei +1

Most recent research in network revenue management incorporates choice behavior that models the customers' buying logic. These models are consequently more complex to solve, but th…

math.OC2016

Achieving an optimal trade-off between revenue and energy peak within a smart grid environment

Sezin Afsar, Luce Brotcorne, Patrice Marcotte +1

We consider an energy provider whose goal is to simultaneously set revenue-maximizing prices and meet a peak load constraint. In our bilevel setting, the provider acts as a leader…

cs.GT2004★ 65 cited

An Approximation Algorithm for Stackelberg Network Pricing

S. Roch, P. Marcotte, G. Savard

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible sho…