173
click to vote
CPAIOR
15 years 10 months ago
2007 Springer 
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
126
click to vote
CPAIOR
15 years 10 months ago
2007 Springer 
Portfolio selection is a relevant problem arising in finance and economics. While its basic formulations can be efficiently solved through linear or quadratic programming, its mor...
123
click to vote
CPAIOR
15 years 10 months ago
2007 Springer 
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
133
click to vote
CPAIOR
15 years 10 months ago
2007 Springer 
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
118
click to vote
CPAIOR
15 years 10 months ago
2007 Springer
This paper introduces DEVIATION, a soft global constraint to obtain balanced solutions. A violation measure of the perfect balance can be defined as the Lp norm of the vector vari...
|
Operations Research