Sciweavers

342 search results - page 46 / 69
» Constrained Integer Partitions
Sort
View
EOR
2006
83views more  EOR 2006»
14 years 9 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
MP
2006
79views more  MP 2006»
14 years 9 months ago
Projection results for vehicle routing
A variety of integer programming formulations have been proposed for Vehicle Routing Problems (VRPs), including the so-called two- and three-index formulations, the set partitioni...
Adam N. Letchford, Juan José Salazar Gonz&a...
COMBINATORICS
2004
54views more  COMBINATORICS 2004»
14 years 9 months ago
When Can You Tile a Box With Translates of Two Given Rectangular Bricks?
When can a d-dimensional rectangular box R be tiled by translates of two given d-dimensional rectangular bricks B1 and B2? We prove that R can be tiled by translates of B1 and B2 ...
Richard J. Bower, T. S. Michael
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
13 years 8 days ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...