158 search results - page 20 / 32 » Solving Sequential Mixed Auctions with Integer Programming |
CP
2005
Springer
14 years 1 months ago
2005
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
IOR
2007
13 years 7 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
ICC
2009
IEEE
14 years 2 months ago
2009
IEEE
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
EUROPAR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract In this paper, we focus on the problem of scheduling batches of identical task graphs on a heterogeneous platform, when the task graph consists in a tree. We rely on stead...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
—It is not possible to ensure that a network is absolutely secure. Therefore, network operators must continually change their defense strategies to counter attackers who constant...