Adder model for mixed integer linear programming
Copyright policy )Adder model for mixed integer linear programming
Satisfiability problems (SAT) for register transfer level designs combine arithmetic blocks with Boolean logic to form a mixed integer linear programming (MILP) environment. The classic model of the two-input n-bit adder for MILP is straightforward. However, proposed is a more efficient method using a new set of inequalities that describes its integer hull polyhedron. This special model reduces the number of branches needed to solve the whole integer problem, optimising the overall efficiency of the SAT solver. Experimental results show a CPU time reduction greater than one order of magnitude or higher, depending on the size of the problem.
0,665
0,97
SCIE
349
348
Q1
Q3
- Gwangju Institute of Science and Technology Korea (Republic of)
- University of Las Palmas de Gran Canaria Spain
computability, adders, Linear programming, 3307 Tecnología electrónica, digital arithmetic, Boolean algebra, integer programming
computability, adders, Linear programming, 3307 Tecnología electrónica, digital arithmetic, Boolean algebra, integer programming
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!