Valid inequalities and branch-and-cut for the clique pricing problem
type: Item
instance of: scholarly article
title: Valid inequalities and branch-and-cut for the clique pricing problem
zbMATH Open document ID: 1233.90095
author: Géraldine Heilporn
author: Martine Labbé
author: P. Marcotte
author: Gilles Savard
published in: Discrete Optimization
publication date: 2012-03-07T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6012789
zbMATH Keywords: network pricing
zbMATH Keywords: mixed integer programming
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: clique
MaRDI profile type: Publication
full work available at URL: j.disopt.2011.01.001
OpenAlex ID: W2090914983
cites work: Maximum utility product pricing models and algorithms based on reservation price
cites work: A bilevel model of taxation and its application to optimal highway pricing
cites work: Tariff optimization in networks
cites work: Approximation and Online Algorithms
cites work: A polyhedral study of the network pricing problem with connected toll arcs
cites work: Optimal product design using conjoint analysis: Computational complexity and algorithms
cites work: An approximation algorithm for Stackelberg network pricing
cites work: Joint Design and Pricing on a Network
DOI: 10.1016/J.DISOPT.2011.01.001
description: scientific article; zbMATH DE number 6012789