311 search results - page 49 / 63 » Exploiting Decomposition in Constraint Optimization Problems |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
AI
2006
Springer
13 years 7 months ago
2006
Springer
In many situations, a set of hard constraints encodes the feasible configurations of some system or product over which multiple users have distinct preferences. However, making su...
CP
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all informati...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
Group elevator scheduling has long been recognized as an important problem for building transportation efficiency, since unsatisfactory elevator service is one of the major complai...