Sciweavers

732 search results - page 74 / 147
» Termination of Integer Linear Programs
Sort
View
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 9 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
JNW
2006
126views more  JNW 2006»
13 years 9 months ago
Gateway Deployment optimization in Cellular Wi-Fi Mesh Networks
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggr...
Rajesh Prasad, Hongyi Wu
DC
2011
12 years 9 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
CPAIOR
2005
Springer
14 years 2 months ago
Constraint Programming Based Column Generation for Employee Timetabling
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
14 years 1 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