53 search results - page 6 / 11 » Minimal Inequalities for an Infinite Relaxation of Integer P... |
CIS
2008
Springer
13 years 9 months ago
2008
Springer
Delivering continuous services in information infrastructures is a major challenge. For system or network administrators, redundancy allocation is one of the best strategies to en...
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...
CONSTRAINTS
2006
13 years 7 months ago
2006
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...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A sequential quadratic programming (SQP) method is proposed to solve the distributed beamforming problem in multiple relay networks. The problem is formulated as the minimization ...
SODA
2001
ACM
13 years 9 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...