Sciweavers

274 search results - page 4 / 55
» Watermarking integer linear programming solutions
Sort
View
IOR
2006
177views more  IOR 2006»
13 years 7 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
ITC
1999
IEEE
107views Hardware» more  ITC 1999»
13 years 11 months ago
A high-level BIST synthesis method based on a region-wise heuristic for an integer linear programming
A high-level built-in self-test (BIST) synthesis involves several tasks such as system register assignment, interconnection assignment, and BIST register assignment. Existing high...
Han Bin Kim, Dong Sam Ha
COLOGNETWENTE
2009
13 years 8 months ago
Integer Programming with 2-Variable Equations and 1-Variable Inequalities
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
4OR
2006
100views more  4OR 2006»
13 years 7 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...
ACISICIS
2008
IEEE
14 years 1 months ago
An Integer Linear Programming Approach for Dedicated Machine Constraint
Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous research...
Huy Nguyen Anh Pham, Arthur M. D. Shr, Peter P. Ch...