Sciweavers

728 search results - page 10 / 146
» Efficient Searching with Linear Constraints
Sort
View
INFORMS
2007
150views more  INFORMS 2007»
15 years 1 months ago
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
— We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlin...
Julián Molina Luque, Manuel Laguna, Rafael ...
EPIA
2001
Springer
15 years 6 months ago
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
Jorge Cruz, Pedro Barahona
ICTAI
2010
IEEE
14 years 11 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...
115
Voted
CPAIOR
2006
Springer
15 years 3 months ago
Conflict-Directed A* Search for Soft Constraints
As many real-world problems involve user preferences, costs, or probabilities, constraint satisfaction has been extended to optimization by generalizing hard constraints to soft co...
Martin Sachenbacher, Brian C. Williams
UAI
2008
15 years 3 months ago
Partitioned Linear Programming Approximations for MDPs
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal...
Branislav Kveton, Milos Hauskrecht