Sciweavers

1274 search results - page 42 / 255
» N-fold integer programming
Sort
View
IPCO
2007
143views Optimization» more  IPCO 2007»
13 years 11 months 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 3 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...
CP
2004
Springer
14 years 3 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
CISIS
2008
IEEE
14 years 4 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,...
4OR
2006
100views more  4OR 2006»
13 years 10 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...