157 search results - page 2 / 32 » Robust Solutions for Constraint Satisfaction and Optimizatio... |
AAAI
2006
13 years 7 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
AAAI
2006
13 years 7 months ago
2006
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
CPAIOR
2006
Springer
13 years 9 months ago
2006
Springer
We show that various duals that occur in optimization and constraint satisfaction can be classified as inference duals, relaxation duals, or both. We discuss linear programming, su...
CP
1995
Springer
13 years 9 months ago
1995
Springer
We present a method for finding optimal partial solutions to overconstrained instances of the Disjunctive Temporal Problems (DTP). The solutions are optimal in that they satisfy ...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a complete, constructive search technique that has been shown to out-perform standard constructive search techniques on ...