Sciweavers

322 search results - page 5 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
TCAD
2002
110views more  TCAD 2002»
13 years 7 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
EOR
2010
140views more  EOR 2010»
13 years 5 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
IPCO
2007
77views Optimization» more  IPCO 2007»
13 years 9 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli
ICDM
2007
IEEE
148views Data Mining» more  ICDM 2007»
14 years 1 months ago
Binary Matrix Factorization with Applications
An interesting problem in Nonnegative Matrix Factorization (NMF) is to factorize the matrix X which is of some specific class, for example, binary matrix. In this paper, we exten...
Zhongyuan Zhang, Tao Li, Chris H. Q. Ding, Xiangsu...
CCE
2004
13 years 7 months ago
Modeling and solving real-time scheduling problems by stochastic integer programming
This contribution deals with scheduling problems of flexible chemical batch processes with a special emphasis on their real-time character. This implies not only the need for suff...
Guido Sand, Sebastian Engell