270 search results - page 24 / 54 » Constraint relaxation in approximate linear programs |
131
Voted
JCSC
1998
15 years 3 days ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
98
Voted
INFORMS
2000
15 years 7 days ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
111
click to vote
CP
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
116
click to vote
CONSTRAINTS
2006
15 years 14 days 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...
STOC
2006
ACM
16 years 22 days ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...