CMP.Preface:3.1 - Construct an algorithm

CMP.1 connects a new computational problem to a solver for another one. Its conversion and answer recovery also determine the direction in which an impossibility or resource result can travel. CMP.2 constructs a recursive procedure by choosing smaller problems, sufficient returned information and a reason for progress. CMP.3 turns repeated subcomputations into a shared dependency structure, choosing evaluation order and what to store or recompute.

CMP.5 obtains a tractable relaxation and connects its bound or solution back to the original problem. CMP.4 uses such bounds, or other justified conditions, to exclude search branches without losing the requested result. A feasible candidate can be useful before search finishes; its quality claim depends on the remaining alternatives and available bound.

CMP.6 constructs an admissible iterative change from local information. The neighborhood and progress argument decide what stopping establishes. CMP.7 constructs the procedure that selects or updates a rule from examples and feedback. It separates that procedure from the resulting rule and separates successful optimization from what the rule supports on further cases. Search or iterative updating can supply its obtaining operation.