Sciweavers

2976 search results - page 69 / 596
» On the bounded integer programming
Sort
View
IPCO
2007
143views Optimization» more  IPCO 2007»
14 years 18 days ago
On the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
Ricardo Fukasawa, Marcos Goycoolea
CC
2005
Springer
115views System Software» more  CC 2005»
14 years 4 months ago
Experiences with Enumeration of Integer Projections of Parametric Polytopes
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
Sven Verdoolaege, Kristof Beyls, Maurice Bruynoogh...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 11 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
JDA
2006
83views more  JDA 2006»
13 years 11 months ago
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
CP
2004
Springer
14 years 4 months ago
Global Constraints for Integer and Set Value Precedence
The paper introduces value precedence on integer and set sequences. A useful application of the notion is in breaking symmetries of indistinguishable values, an important class of ...
Yat Chiu Law, Jimmy Ho-Man Lee