123 search results - page 13 / 25 » anor 2007 |
ANOR
2002
13 years 9 months ago
2002
This article is devoted to adverse selection problems in which individual private information is a whole utility function and cannot be reduced to some finite-dimensional parameter...
ANOR
2002
13 years 9 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
ANOR
2002
13 years 9 months ago
2002
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
ANOR
2005
13 years 9 months ago
2005
The main objects here are finite-strategy games in which entropic terms are subtracted from the payoffs. After such subtraction each Nash equilibrium solves an explicit, unconstra...
ANOR
2002
13 years 9 months ago
2002
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...