We study dynamic decision-making under uncertainty when, at each period, a decision-maker implements a solution to a combinatorial optimization problem. The objective coefficient vectors of said problem, which are unobserved prior to implementation, vary from period to period. These vectors,...

Questionnaires for adaptive choice-based conjoint analysis aim at minimizing some measure of the uncer- tainty associated with estimates of preference parameters (e.g. partworths). Bayesian approaches to conjoint analysis quantify this uncertainty with a multivariate distribution that is updated...

A simple relaxation of two rows of a simplex tableau is a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. Recently Andersen et al. [2] and Cornu´ejols and Margot [13] showed that the facet-defining inequalities of this set are...

Given a valid inequality for the mixed integer infinite group relaxation, a lifting based approach is presented that can be used to strengthen this inequality. Bounds on the solution of the corresponding lifting problem and some necessary conditions for the lifted inequality to be minimal for...

Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer sets have been characterized. In this paper, we consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the...