Sciweavers

2061 search results - page 2 / 413
» The continuous knapsack set
Sort
View
EOR
2000
74views more  EOR 2000»
13 years 4 months ago
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
Andrew J. Miller, George L. Nemhauser, Martin W. P...
IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 6 months ago
Semi-continuous Cuts for Mixed-Integer Programming
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
I. R. de Farias
MP
2010
81views more  MP 2010»
13 years 3 months ago
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
Jean-Philippe P. Richard, Mohit Tawarmalani
ATAL
2006
Springer
13 years 8 months ago
Adaptive Pricing for Customers with Probabilistic Valuations
Abstract. In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. ...
Michael Benisch, James Andrews, Norman M. Sadeh