592 search results - page 78 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
125
click to vote
EOR
2010
15 years 11 days ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
133
click to vote
IOR
2007
15 years 2 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...
155
click to vote
SIAMJO
2002
15 years 2 months ago
2002
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
136
click to vote
ISPD
2000
ACM
15 years 7 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
120
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
—This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signalto-interference-plus...