A branch-and-bound project assignment methodology with generalized network strategies for updating bounds /
The objective of this thesis is to develop a branch-and-bound procedure to accommodate the generalized network model for project assignment problems. The solution from this algorithm yields the optimal solution with binary flows in the network. This approach can be used as a decision-support methodo...
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1999.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
Internet
Link to OAKTrust copyCushing: Theses & Dissertations Microforms (Does not check out)
| Call Number: |
1999 Thesis J58 |
|
|---|---|---|
| Call Number | Status | Get It |
| 1999 Thesis J58 | Available | |
Available Online
| Call Number: |
1999 Thesis J58 |
|
|---|---|---|
| Call Number | Status | Get It |
| 1999 Thesis J58 | Available | |