A counterexample to the assertion that the degree of difficulty of a geometric programming problem if #terms - #variables - 1 / / by R.E.D. Woolsey, H.S. Swanson.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Book |
| Language: | English |
| Published: |
Boulder :
Business Research Division, Graduate School of Business Administration, University of Colorado,
1971.
|
| Series: | Management science report series ;
report no. 71-7. |
| Subjects: |
PASCAL Offsite
| Call Number: |
T57.825 .W6
|
|---|---|
| T57.825 .W6 | Available Place a Hold |