54 search results - page 1 / 11 » Approximability of Integer Programming with Generalised Cons... |
CP
2006
Springer
14 years 1 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
IPL
2008
13 years 9 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
CORR
2002
Springer
13 years 9 months ago
2002
Springer
In this paper we study approximation algorithms for solving a general covering integer program. An
DAC
2006
ACM
14 years 10 months ago
2006
ACM
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
ENDM
2010
13 years 7 months ago
2010
Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constrai...