A constraint branch-and-bound method for set partitioning problems
Approved for public release; distribution is unlimited. === This thesis compares the efficiency of a constraint branch-and-bound method against the conventional variable branch-and-bound method in solving set partitioning problems. Because of the difficulties encountered in writing the constraint br...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Monterey, California: Naval Postgraduate School
2013
|
| Online Access: | http://hdl.handle.net/10945/34858 |