1723 search results - page 119 / 345 » Cycling in linear programming problems |
STRINGOLOGY
2004
14 years 11 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
INFORMS
2000
14 years 10 months 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 ...
CP
2004
Springer
15 years 3 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
IEEEPACT
1998
IEEE
15 years 2 months ago
1998
IEEE
Global locality analysis is a technique for improving the cache performance of a sequence of loop nests through a combination of loop and data layout optimizations. Pure loop tran...
82
Voted
COLT
1999
Springer
15 years 2 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...