- Timestamp:
- Jul 25, 2007 9:39:44 AM (14 years ago)
- Location:
- trunk/Cbc/examples
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/Cbc/examples/CbcBranchUser.cpp
r640 r705 139 139 4 - take cheapest up branch if infeasibilities same 140 140 */ 141 int bestNumber= INT_MAX;141 int bestNumber=COIN_INT_MAX; 142 142 double bestCriterion=-1.0e50; 143 143 double alternativeCriterion = -1.0; -
trunk/Cbc/examples/CbcSolver2.cpp
r83 r705 445 445 for (int i=0;i<numberColumns;i++) { 446 446 if (keep&&keep[i]) 447 node_[i]= INT_MAX;447 node_[i]=COIN_INT_MAX; 448 448 else 449 449 node_[i]=0; -
trunk/Cbc/examples/CbcSolver3.cpp
r174 r705 487 487 for (int i=0;i<numberColumns;i++) { 488 488 if (keep&&keep[i]) 489 node_[i]= INT_MAX;489 node_[i]=COIN_INT_MAX; 490 490 else 491 491 node_[i]=0; -
trunk/Cbc/examples/CbcSolverLongThin.cpp
r124 r705 69 69 int nNewRow=0; 70 70 int nNewCol=0; 71 int sizeDynamic = INT_MAX;71 int sizeDynamic = COIN_INT_MAX; 72 72 int smallOriginalNumberRows=0; 73 73 if (algorithm_==0) { … … 714 714 for (int i=0;i<numberColumns;i++) { 715 715 if (keep[i]) 716 node_[i]= INT_MAX;716 node_[i]=COIN_INT_MAX; 717 717 else 718 718 node_[i]=0;
Note: See TracChangeset
for help on using the changeset viewer.