307
click to vote
CCO
15 years 7 months ago
2001 Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
130
Voted
CPM
15 years 7 months ago
2001 Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
135
click to vote
CCO
15 years 7 months ago
2001 Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
DMCCG
15 years 7 months ago
2001 Springer |