Adaptive Pricing for Customers with Probabilistic Valuations Michael Benisch, James Andrews and Norman Sadeh School of Computer Science, Carnegie Mellon University Abstract. In this paper, we examine the problem of choo

First Page		Document Content
Date: 2013-12-07 17:24:09 Applied mathematics Operations research Marketing Pricing NP-complete problems Continuous knapsack problem Knapsack problem Optimization problem Price Theoretical computer science Computational complexity theory Combinatorial optimization		Adaptive Pricing for Customers with Probabilistic Valuations Michael Benisch, James Andrews and Norman Sadeh School of Computer Science, Carnegie Mellon University Abstract. In this paper, we examine the problem of choo Add to Reading List Source URL: jimmylands.com Download Document from Source Website File Size: 231,92 KB Share Document on Facebook

	Large-scale multi-period precedence constrained knapsack problem: A mining application 1 Eduardo Moreno a,2 Daniel Espinoza b,3 Marcos Goycoolea c,4 a Faculty of Engineering and Science, Universidad Adolfo Iba˜ DocID: 1tPWZ - View Document
	Complexity in Geometric SINR Olga Goussevskaia Yvonne Anne Oswald Roger Wattenhofer DocID: 1rrUb - View Document
	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 DocID: 1rdLy - View Document
	How to Place Efficiently Guards and Paintings in an Art Gallery Christodoulos Fragoudakis∗†, Euripides Markou∗‡ and Stathis Zachos§ April 25, 2005 Abstract DocID: 1r85C - View Document
	COLUMN GENERATION WITH GAMS ERWIN KALVELAGEN Abstract. This document describes an implementation of a Column Generation algorithm using GAMS. The well-known cutting stock problem and a personnel planning problem are used DocID: 1r5tA - View Document