Sciweavers

275 search results - page 10 / 55
» Colored Nonograms: An Integer Linear Programming Approach
Sort
View
NETWORKS
2008
13 years 6 months ago
Lower bounds for two-period grooming via linear programming duality
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
Charles J. Colbourn, Gaetano Quattrocchi, Violet R...
ICCD
2003
IEEE
109views Hardware» more  ICCD 2003»
14 years 3 months ago
Independent Test Sequence Compaction through Integer Programming
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...
Petros Drineas, Yiorgos Makris
HM
2009
Springer
165views Optimization» more  HM 2009»
13 years 11 months ago
Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search
Abstract. A Video-on-Demand system usually consists of a large number of independent video servers. In order to utilize network resources as efficiently as possible the overall net...
Jakob Walla, Mario Ruthmair, Günther R. Raidl
CISIS
2008
IEEE
14 years 1 months ago
Hardware Software Partitioning Problem in Embedded System Design Using Particle Swarm Optimization Algorithm
Hardware/software partitioning is a crucial problem in embedded system design. In this paper, we provide an alternative approach to solve this problem using Particle Swarm Optimiz...
Alakananda Bhattacharya, Amit Konar, Swagatam Das,...
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 4 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi