414 search results - page 21 / 83 » Integer Linear Programming Models for Global Routing |
HYBRID
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
116
click to vote
CP
2010
Springer
14 years 8 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
DISOPT
2008
14 years 9 months ago
2008
Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...
ICWN
2004
14 years 11 months ago
2004
A critical issue in the design of routing protocols for wireless sensor networks is the efficient utilization of resources such as scarce bandwidth and limited energy supply. Many ...