158 search results - page 7 / 32 » Solving Sequential Mixed Auctions with Integer Programming |
CONSTRAINTS
2010
13 years 7 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
CPAIOR
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
EURODAC
1994
IEEE
1994
IEEE
OSCAR: optimum simultaneous scheduling, allocation and resource binding based on integer programming
13 years 11 months ago
: This paper presents an approach to high-level synthesis which is based upon a 0/1 integer programming model. In contrast to other approaches, this model allows solving all three ...