Sciweavers

1996 search results - page 64 / 400
» A decision procedure for linear
Sort
View
AAAI
2012
13 years 2 months ago
Sequential Decision Making with Rank Dependent Utility: A Minimax Regret Approach
This paper is devoted to sequential decision making with Rank Dependent expected Utility (RDU). This decision criterion generalizes Expected Utility and enables to model a wider r...
Gildas Jeantet, Patrice Perny, Olivier Spanjaard
CADE
2011
Springer
13 years 12 months ago
Cutting to the Chase Solving Linear Integer Arithmetic
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
Dejan Jovanovic, Leonardo Mendonça de Moura
IJCAI
2003
15 years 1 months ago
Incremental Utility Elicitation with the Minimax Regret Decision Criterion
Utility elicitation is a critical function of any automated decision aid, allowing decisions to be tailored to the preferences of a specific user. However, the size and complexit...
Tianhan Wang, Craig Boutilier
CPAIOR
2007
Springer
15 years 6 months ago
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
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...
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
CP
2000
Springer
15 years 4 months ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
Philippe Refalo