Algorithms and hardware for the solution of set partitioning problems
This thesis is concerned with an integer linear programming problem, called the set partitioning problem. The problem is: minimize cx, subject to Ax=e, where A is a binary matrix, e is a column of ones, and c is a cost vector. Despite its particularly simple structure, the set partitioning problem h...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/2429/23407 |