Integer Linear Program Formulation
The maximum set packing problem can be formulated as the following integer linear program.
| maximize | (maximize the total value) | ||
| subject to | for all | (selected sets have to be pairwise disjoint) | |
| for all . | (every set is either in the set packing or not) |
Read more about this topic: Set Packing
Famous quotes containing the words program and/or formulation:
“The Kid had a lurking devil in him ... It was a good-humored, jovial imp, or a cruel and blood-thirsty fiend, as circumstances prompted. He always laughed when killing, but fire seemed to dart from his eyes.”
—State of New Mexico, U.S. public relief program (1935-1943)
“Art is an experience, not the formulation of a problem.”
—Lindsay Anderson (b. 1923)