Sciweavers

CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
13 years 11 months ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
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...
Alexander Martin
CPM
2001
Springer
211views Combinatorics» more  CPM 2001»
13 years 11 months ago
Fuzzy Hamming Distance: A New Dissimilarity Measure
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
Abraham Bookstein, Shmuel T. Klein, Timo Raita
DMCCG
2001
Springer
173views Combinatorics» more  DMCCG 2001»
13 years 11 months ago
The Chip Firing Game and Matroid Complexes
Criel Merino
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
13 years 11 months ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
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...
Yves Pochet
DMCCG
2001
Springer
164views Combinatorics» more  DMCCG 2001»
13 years 11 months ago
A Bijection for Directed-Convex Polyominoes
Alberto Del Lungo, Massimo Mirolli, Renzo Pinzani,...
Combinatorics
Top of PageReset Settings