Sciweavers

2976 search results - page 170 / 596
» On the bounded integer programming
Sort
View
CP
2009
Springer
16 years 7 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
CP
2003
Springer
15 years 11 months ago
Semi-independent Partitioning: A Method for Bounding the Solution to COP's
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
David Larkin
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
16 years 6 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
MFCS
2010
Springer
15 years 4 months ago
Weights of Exact Threshold Functions
We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute va...
László Babai, Kristoffer Arnsfelt Ha...
SPAA
2009
ACM
16 years 7 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...