• Citer

Valid inequalities and branch-and-cut for the clique pricing problem

par Heilporn, Géraldine ;Labbé, Martine ;Marcotte, Patrice;Savard, Gilles
Référence Discrete Optimization, 8, 3, page (393-410)
Publication Publié, 2011-08

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation network. We formulate the problem as a linear mixed integer program and propose strong valid inequalities, some of which define facets of the two-commodity polyhedron. The numerical efficiency of these inequalities is assessed by embedding them within a branch-and-cut framework. © 2011 Elsevier B.V. All rights reserved.