Optimally Solving MCM Related Problems Using Integer Linear Programming
In this chapter, optimal methods are considered to solve the PMCM problem as well as the MCM problem with adder depth constraints (the MCMMAD and MCMBAD as defined in Section 2.4). For that we formulate the problems using integer linear programming (ILP). Of course, optimal results can only be achieved for relatively small problems, so there will be still a need for good heuristics like the RPAG algorithm presented in the last chapter.
Unable to display preview. Download preview PDF.