forked from coin-or/Clp
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathClpNode.cpp
1265 lines (1241 loc) · 39.3 KB
/
ClpNode.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* $Id$ */
// Copyright (C) 2008, International Business Machines
// Corporation and others. All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).
#include "CoinPragma.hpp"
#include "ClpSimplex.hpp"
#include "ClpNode.hpp"
#include "ClpFactorization.hpp"
#include "ClpDualRowSteepest.hpp"
//#############################################################################
// Constructors / Destructor / Assignment
//#############################################################################
//-------------------------------------------------------------------
// Default Constructor
//-------------------------------------------------------------------
ClpNode::ClpNode()
: branchingValue_(0.5)
, objectiveValue_(0.0)
, sumInfeasibilities_(0.0)
, estimatedSolution_(0.0)
, factorization_(NULL)
, weights_(NULL)
, status_(NULL)
, primalSolution_(NULL)
, dualSolution_(NULL)
, lower_(NULL)
, upper_(NULL)
, pivotVariables_(NULL)
, fixed_(NULL)
, sequence_(1)
, numberInfeasibilities_(0)
, depth_(0)
, numberFixed_(0)
, flags_(0)
, maximumFixed_(0)
, maximumRows_(0)
, maximumColumns_(0)
, maximumIntegers_(0)
{
branchState_.firstBranch = 0;
branchState_.branch = 0;
}
//-------------------------------------------------------------------
// Useful Constructor from model
//-------------------------------------------------------------------
ClpNode::ClpNode(ClpSimplex *model, const ClpNodeStuff *stuff, int depth)
: branchingValue_(0.5)
, objectiveValue_(0.0)
, sumInfeasibilities_(0.0)
, estimatedSolution_(0.0)
, factorization_(NULL)
, weights_(NULL)
, status_(NULL)
, primalSolution_(NULL)
, dualSolution_(NULL)
, lower_(NULL)
, upper_(NULL)
, pivotVariables_(NULL)
, fixed_(NULL)
, sequence_(1)
, numberInfeasibilities_(0)
, depth_(0)
, numberFixed_(0)
, flags_(0)
, maximumFixed_(0)
, maximumRows_(0)
, maximumColumns_(0)
, maximumIntegers_(0)
{
branchState_.firstBranch = 0;
branchState_.branch = 0;
gutsOfConstructor(model, stuff, 0, depth);
}
//-------------------------------------------------------------------
// Most of work of constructor from model
//-------------------------------------------------------------------
void ClpNode::gutsOfConstructor(ClpSimplex *model, const ClpNodeStuff *stuff,
int arraysExist, int depth)
{
int numberRows = model->numberRows();
int numberColumns = model->numberColumns();
int numberTotal = numberRows + numberColumns;
int maximumTotal = maximumRows_ + maximumColumns_;
depth_ = depth;
// save stuff
objectiveValue_ = model->objectiveValue() * model->optimizationDirection();
estimatedSolution_ = objectiveValue_;
flags_ = 1; //say scaled
if (!arraysExist) {
maximumRows_ = CoinMax(maximumRows_, numberRows);
maximumColumns_ = CoinMax(maximumColumns_, numberColumns);
maximumTotal = maximumRows_ + maximumColumns_;
assert(!factorization_);
factorization_ = new ClpFactorization(*model->factorization(), numberRows);
status_ = CoinCopyOfArrayPartial(model->statusArray(), maximumTotal, numberTotal);
primalSolution_ = CoinCopyOfArrayPartial(model->solutionRegion(), maximumTotal, numberTotal);
dualSolution_ = CoinCopyOfArrayPartial(model->djRegion(), maximumTotal, numberTotal); //? has duals as well?
pivotVariables_ = CoinCopyOfArrayPartial(model->pivotVariable(), maximumRows_, numberRows);
ClpDualRowSteepest *pivot = dynamic_cast< ClpDualRowSteepest * >(model->dualRowPivot());
if (pivot) {
assert(!weights_);
weights_ = new ClpDualRowSteepest(*pivot);
}
} else {
if (arraysExist == 2)
assert(lower_);
if (numberRows <= maximumRows_ && numberColumns <= maximumColumns_) {
CoinMemcpyN(model->statusArray(), numberTotal, status_);
if (arraysExist == 1) {
*factorization_ = *model->factorization();
CoinMemcpyN(model->solutionRegion(), numberTotal, primalSolution_);
CoinMemcpyN(model->djRegion(), numberTotal, dualSolution_); //? has duals as well?
ClpDualRowSteepest *pivot = dynamic_cast< ClpDualRowSteepest * >(model->dualRowPivot());
if (pivot) {
if (weights_) {
//if (weights_->numberRows()==pivot->numberRows()) {
weights_->fill(*pivot);
//} else {
//delete weights_;
//weights_ = new ClpDualRowSteepest(*pivot);
//}
} else {
weights_ = new ClpDualRowSteepest(*pivot);
}
}
CoinMemcpyN(model->pivotVariable(), numberRows, pivotVariables_);
} else {
CoinMemcpyN(model->primalColumnSolution(), numberColumns, primalSolution_);
CoinMemcpyN(model->dualColumnSolution(), numberColumns, dualSolution_);
flags_ = 0;
CoinMemcpyN(model->dualRowSolution(), numberRows, dualSolution_ + numberColumns);
}
} else {
// size has changed
maximumRows_ = CoinMax(maximumRows_, numberRows);
maximumColumns_ = CoinMax(maximumColumns_, numberColumns);
maximumTotal = maximumRows_ + maximumColumns_;
delete weights_;
weights_ = NULL;
delete[] status_;
delete[] primalSolution_;
delete[] dualSolution_;
delete[] pivotVariables_;
status_ = CoinCopyOfArrayPartial(model->statusArray(), maximumTotal, numberTotal);
primalSolution_ = new double[maximumTotal * sizeof(double)];
dualSolution_ = new double[maximumTotal * sizeof(double)];
if (arraysExist == 1) {
*factorization_ = *model->factorization(); // I think this is OK
CoinMemcpyN(model->solutionRegion(), numberTotal, primalSolution_);
CoinMemcpyN(model->djRegion(), numberTotal, dualSolution_); //? has duals as well?
ClpDualRowSteepest *pivot = dynamic_cast< ClpDualRowSteepest * >(model->dualRowPivot());
if (pivot) {
assert(!weights_);
weights_ = new ClpDualRowSteepest(*pivot);
}
} else {
CoinMemcpyN(model->primalColumnSolution(), numberColumns, primalSolution_);
CoinMemcpyN(model->dualColumnSolution(), numberColumns, dualSolution_);
flags_ = 0;
CoinMemcpyN(model->dualRowSolution(), numberRows, dualSolution_ + numberColumns);
}
pivotVariables_ = new int[maximumRows_];
if (model->pivotVariable() && model->numberRows() == numberRows)
CoinMemcpyN(model->pivotVariable(), numberRows, pivotVariables_);
else
CoinFillN(pivotVariables_, numberRows, -1);
}
}
numberFixed_ = 0;
const double *lower = model->columnLower();
const double *upper = model->columnUpper();
const double *solution = model->primalColumnSolution();
const char *integerType = model->integerInformation();
const double *columnScale = model->columnScale();
if (!flags_)
columnScale = NULL; // as duals correct
int iColumn;
sequence_ = -1;
double integerTolerance = stuff->integerTolerance_;
double mostAway = 0.0;
int bestPriority = COIN_INT_MAX;
sumInfeasibilities_ = 0.0;
numberInfeasibilities_ = 0;
int nFix = 0;
double gap = CoinMax(model->dualObjectiveLimit() - objectiveValue_, 1.0e-4);
#define PSEUDO 3
#if PSEUDO == 1 || PSEUDO == 2
// Column copy of matrix
ClpPackedMatrix *matrix = model->clpScaledMatrix();
const double *objective = model->costRegion();
if (!objective) {
objective = model->objective();
//if (!matrix)
matrix = dynamic_cast< ClpPackedMatrix * >(model->clpMatrix());
} else if (!matrix) {
matrix = dynamic_cast< ClpPackedMatrix * >(model->clpMatrix());
}
const double *element = matrix->getElements();
const int *row = matrix->getIndices();
const CoinBigIndex *columnStart = matrix->getVectorStarts();
const int *columnLength = matrix->getVectorLengths();
double direction = model->optimizationDirection();
const double *dual = dualSolution_ + numberColumns;
#if PSEUDO == 2
double *activeWeight = new double[numberRows];
const double *rowLower = model->rowLower();
const double *rowUpper = model->rowUpper();
const double *rowActivity = model->primalRowSolution();
double tolerance = 1.0e-6;
for (int iRow = 0; iRow < numberRows; iRow++) {
// could use pi to see if active or activity
if (rowActivity[iRow] > rowUpper[iRow] - tolerance
|| rowActivity[iRow] < rowLower[iRow] + tolerance) {
activeWeight[iRow] = 0.0;
} else {
activeWeight[iRow] = -1.0;
}
}
for (int iColumn = 0; iColumn < numberColumns; iColumn++) {
if (integerType[iColumn]) {
double value = solution[iColumn];
if (fabs(value - floor(value + 0.5)) > 1.0e-6) {
CoinBigIndex start = columnStart[iColumn];
CoinBigIndex end = start + columnLength[iColumn];
for (CoinBigIndex j = start; j < end; j++) {
int iRow = row[j];
if (activeWeight[iRow] >= 0.0)
activeWeight[iRow] += 1.0;
}
}
}
}
for (int iRow = 0; iRow < numberRows; iRow++) {
if (activeWeight[iRow] > 0.0) {
// could use pi
activeWeight[iRow] = 1.0 / activeWeight[iRow];
} else {
activeWeight[iRow] = 0.0;
}
}
#endif
#endif
const double *downPseudo = stuff->downPseudo_;
const int *numberDown = stuff->numberDown_;
const int *numberDownInfeasible = stuff->numberDownInfeasible_;
const double *upPseudo = stuff->upPseudo_;
const int *priority = stuff->priority_;
const int *numberUp = stuff->numberUp_;
const int *numberUpInfeasible = stuff->numberUpInfeasible_;
int numberBeforeTrust = stuff->numberBeforeTrust_;
int stateOfSearch = stuff->stateOfSearch_;
int iInteger = 0;
// weight at 1.0 is max min (CbcBranch was 0.8,0.1) (ClpNode was 0.9,0.9)
#define WEIGHT_AFTER 0.9
#define WEIGHT_BEFORE 0.2
//Stolen from Constraint Integer Programming book (with epsilon change)
#define WEIGHT_PRODUCT
#ifdef WEIGHT_PRODUCT
double smallChange = stuff->smallChange_;
#endif
#ifndef INFEAS_MULTIPLIER
#define INFEAS_MULTIPLIER 1.0
#endif
for (iColumn = 0; iColumn < numberColumns; iColumn++) {
if (integerType[iColumn]) {
double value = solution[iColumn];
value = CoinMax(value, static_cast< double >(lower[iColumn]));
value = CoinMin(value, static_cast< double >(upper[iColumn]));
double nearest = floor(value + 0.5);
if (fabs(value - nearest) > integerTolerance) {
numberInfeasibilities_++;
sumInfeasibilities_ += fabs(value - nearest);
#if PSEUDO == 1 || PSEUDO == 2
double upValue = 0.0;
double downValue = 0.0;
double value2 = direction * objective[iColumn];
//double dj2=value2;
if (value2) {
if (value2 > 0.0)
upValue += 1.5 * value2;
else
downValue -= 1.5 * value2;
}
CoinBigIndex start = columnStart[iColumn];
CoinBigIndex end = columnStart[iColumn] + columnLength[iColumn];
for (CoinBigIndex j = start; j < end; j++) {
int iRow = row[j];
value2 = -dual[iRow];
if (value2) {
value2 *= element[j];
//dj2 += value2;
#if PSEUDO == 2
assert(activeWeight[iRow] > 0.0 || fabs(dual[iRow]) < 1.0e-6);
value2 *= activeWeight[iRow];
#endif
if (value2 > 0.0)
upValue += value2;
else
downValue -= value2;
}
}
//assert (fabs(dj2)<1.0e-4);
int nUp = numberUp[iInteger];
double upValue2 = (upPseudo[iInteger] / (1.0 + nUp));
// Extra for infeasible branches
if (nUp) {
double ratio = 1.0 + INFEAS_MULTIPLIER * static_cast< double >(numberUpInfeasible[iInteger]) / static_cast< double >(nUp);
upValue2 *= ratio;
}
int nDown = numberDown[iInteger];
double downValue2 = (downPseudo[iInteger] / (1.0 + nDown));
if (nDown) {
double ratio = 1.0 + INFEAS_MULTIPLIER * static_cast< double >(numberDownInfeasible[iInteger]) / static_cast< double >(nDown);
downValue2 *= ratio;
}
//printf("col %d - downPi %g up %g, downPs %g up %g\n",
// iColumn,upValue,downValue,upValue2,downValue2);
upValue = CoinMax(0.1 * upValue, upValue2);
downValue = CoinMax(0.1 * downValue, downValue2);
//upValue = CoinMax(upValue,1.0e-8);
//downValue = CoinMax(downValue,1.0e-8);
upValue *= ceil(value) - value;
downValue *= value - floor(value);
double infeasibility;
//if (depth>1000)
//infeasibility = CoinMax(upValue,downValue)+integerTolerance;
//else
if (stateOfSearch <= 2) {
// no solution
infeasibility = (1.0 - WEIGHT_BEFORE) * CoinMax(upValue, downValue) + WEIGHT_BEFORE * CoinMin(upValue, downValue) + integerTolerance;
} else {
#ifndef WEIGHT_PRODUCT
infeasibility = (1.0 - WEIGHT_AFTER) * CoinMax(upValue, downValue) + WEIGHT_AFTER * CoinMin(upValue, downValue) + integerTolerance;
#else
infeasibility = CoinMax(CoinMax(upValue, downValue), smallChange) * CoinMax(CoinMin(upValue, downValue), smallChange);
#endif
}
estimatedSolution_ += CoinMin(upValue2, downValue2);
#elif PSEUDO == 3
int nUp = numberUp[iInteger];
int nDown = numberDown[iInteger];
// Extra 100% for infeasible branches
double upValue = (ceil(value) - value) * (upPseudo[iInteger] / (1.0 + nUp));
if (nUp) {
double ratio = 1.0 + INFEAS_MULTIPLIER * static_cast< double >(numberUpInfeasible[iInteger]) / static_cast< double >(nUp);
upValue *= ratio;
}
double downValue = (value - floor(value)) * (downPseudo[iInteger] / (1.0 + nDown));
if (nDown) {
double ratio = 1.0 + INFEAS_MULTIPLIER * static_cast< double >(numberDownInfeasible[iInteger]) / static_cast< double >(nDown);
downValue *= ratio;
}
if (nUp < numberBeforeTrust || nDown < numberBeforeTrust) {
upValue *= 10.0;
downValue *= 10.0;
}
double infeasibility;
//if (depth>1000)
//infeasibility = CoinMax(upValue,downValue)+integerTolerance;
//else
if (stateOfSearch <= 2) {
// no solution
infeasibility = (1.0 - WEIGHT_BEFORE) * CoinMax(upValue, downValue) + WEIGHT_BEFORE * CoinMin(upValue, downValue) + integerTolerance;
} else {
#ifndef WEIGHT_PRODUCT
infeasibility = (1.0 - WEIGHT_AFTER) * CoinMax(upValue, downValue) + WEIGHT_AFTER * CoinMin(upValue, downValue) + integerTolerance;
#else
infeasibility = CoinMax(CoinMax(upValue, downValue), smallChange) * CoinMax(CoinMin(upValue, downValue), smallChange);
//infeasibility += CoinMin(upValue,downValue)*smallChange;
#endif
}
//infeasibility = 0.1*CoinMax(upValue,downValue)+
//0.9*CoinMin(upValue,downValue) + integerTolerance;
estimatedSolution_ += CoinMin(upValue, downValue);
#else
double infeasibility = fabs(value - nearest);
#endif
assert(infeasibility > 0.0);
if (priority[iInteger] < bestPriority) {
mostAway = 0.0;
bestPriority = priority[iInteger];
} else if (priority[iInteger] > bestPriority) {
infeasibility = 0.0;
}
if (infeasibility > mostAway) {
mostAway = infeasibility;
sequence_ = iColumn;
branchingValue_ = value;
branchState_.branch = 0;
#if PSEUDO > 0
if (upValue <= downValue)
branchState_.firstBranch = 1; // up
else
branchState_.firstBranch = 0; // down
#else
if (value <= nearest)
branchState_.firstBranch = 1; // up
else
branchState_.firstBranch = 0; // down
#endif
}
} else if (model->getColumnStatus(iColumn) == ClpSimplex::atLowerBound) {
bool fix = false;
if (columnScale) {
if (dualSolution_[iColumn] > gap * columnScale[iColumn])
fix = true;
} else {
if (dualSolution_[iColumn] > gap)
fix = true;
}
if (fix) {
nFix++;
//printf("fixed %d to zero gap %g dj %g %g\n",iColumn,
// gap,dualSolution_[iColumn], columnScale ? columnScale[iColumn]:1.0);
model->setColumnStatus(iColumn, ClpSimplex::isFixed);
}
} else if (model->getColumnStatus(iColumn) == ClpSimplex::atUpperBound) {
bool fix = false;
if (columnScale) {
if (-dualSolution_[iColumn] > gap * columnScale[iColumn])
fix = true;
} else {
if (-dualSolution_[iColumn] > gap)
fix = true;
}
if (fix) {
nFix++;
//printf("fixed %d to one gap %g dj %g %g\n",iColumn,
// gap,dualSolution_[iColumn], columnScale ? columnScale[iColumn]:1.0);
model->setColumnStatus(iColumn, ClpSimplex::isFixed);
}
}
iInteger++;
}
}
//printf("Choosing %d inf %g pri %d\n",
// sequence_,mostAway,bestPriority);
#if PSEUDO == 2
delete[] activeWeight;
#endif
if (lower_) {
// save bounds
if (iInteger > maximumIntegers_) {
delete[] lower_;
delete[] upper_;
maximumIntegers_ = iInteger;
lower_ = new int[maximumIntegers_];
upper_ = new int[maximumIntegers_];
}
iInteger = 0;
for (iColumn = 0; iColumn < numberColumns; iColumn++) {
if (integerType[iColumn]) {
lower_[iInteger] = static_cast< int >(lower[iColumn]);
upper_[iInteger] = static_cast< int >(upper[iColumn]);
iInteger++;
}
}
}
// Could omit save of fixed if doing full save of bounds
if (sequence_ >= 0 && nFix) {
if (nFix > maximumFixed_) {
delete[] fixed_;
fixed_ = new int[nFix];
maximumFixed_ = nFix;
}
numberFixed_ = 0;
unsigned char *status = model->statusArray();
for (iColumn = 0; iColumn < numberColumns; iColumn++) {
if (status[iColumn] != status_[iColumn]) {
if (solution[iColumn] <= lower[iColumn] + 2.0 * integerTolerance) {
model->setColumnUpper(iColumn, lower[iColumn]);
fixed_[numberFixed_++] = iColumn;
} else {
assert(solution[iColumn] >= upper[iColumn] - 2.0 * integerTolerance);
model->setColumnLower(iColumn, upper[iColumn]);
fixed_[numberFixed_++] = iColumn | 0x10000000;
}
}
}
//printf("%d fixed\n",numberFixed_);
}
}
//-------------------------------------------------------------------
// Copy constructor
//-------------------------------------------------------------------
ClpNode::ClpNode(const ClpNode &)
{
printf("ClpNode copy not implemented\n");
abort();
}
//-------------------------------------------------------------------
// Destructor
//-------------------------------------------------------------------
ClpNode::~ClpNode()
{
delete factorization_;
delete weights_;
delete[] status_;
delete[] primalSolution_;
delete[] dualSolution_;
delete[] lower_;
delete[] upper_;
delete[] pivotVariables_;
delete[] fixed_;
}
//----------------------------------------------------------------
// Assignment operator
//-------------------------------------------------------------------
ClpNode &
ClpNode::operator=(const ClpNode &rhs)
{
if (this != &rhs) {
printf("ClpNode = not implemented\n");
abort();
}
return *this;
}
// Create odd arrays
void ClpNode::createArrays(ClpSimplex *model)
{
int numberColumns = model->numberColumns();
const char *integerType = model->integerInformation();
int iColumn;
int numberIntegers = 0;
for (iColumn = 0; iColumn < numberColumns; iColumn++) {
if (integerType[iColumn])
numberIntegers++;
}
if (numberIntegers > maximumIntegers_ || !lower_) {
delete[] lower_;
delete[] upper_;
maximumIntegers_ = numberIntegers;
lower_ = new int[numberIntegers];
upper_ = new int[numberIntegers];
}
}
// Clean up as crunch is different model
void ClpNode::cleanUpForCrunch()
{
delete weights_;
weights_ = NULL;
}
/* Applies node to model
0 - just tree bounds
1 - tree bounds and basis etc
2 - saved bounds and basis etc
*/
void ClpNode::applyNode(ClpSimplex *model, int doBoundsEtc)
{
int numberColumns = model->numberColumns();
const double *lower = model->columnLower();
const double *upper = model->columnUpper();
if (doBoundsEtc < 2) {
// current bound
int way = branchState_.firstBranch;
if (branchState_.branch > 0)
way = 1 - way;
if (!way) {
// This should also do underlying internal bound
model->setColumnUpper(sequence_, floor(branchingValue_));
} else {
// This should also do underlying internal bound
model->setColumnLower(sequence_, ceil(branchingValue_));
}
// apply dj fixings
for (int i = 0; i < numberFixed_; i++) {
int iColumn = fixed_[i];
if ((iColumn & 0x10000000) != 0) {
iColumn &= 0xfffffff;
model->setColumnLower(iColumn, upper[iColumn]);
} else {
model->setColumnUpper(iColumn, lower[iColumn]);
}
}
} else {
// restore bounds
assert(lower_);
int iInteger = -1;
const char *integerType = model->integerInformation();
for (int iColumn = 0; iColumn < numberColumns; iColumn++) {
if (integerType[iColumn]) {
iInteger++;
if (lower_[iInteger] != static_cast< int >(lower[iColumn]))
model->setColumnLower(iColumn, lower_[iInteger]);
if (upper_[iInteger] != static_cast< int >(upper[iColumn]))
model->setColumnUpper(iColumn, upper_[iInteger]);
}
}
}
if (doBoundsEtc && doBoundsEtc < 3) {
//model->copyFactorization(*factorization_);
model->copyFactorization(*factorization_);
ClpDualRowSteepest *pivot = dynamic_cast< ClpDualRowSteepest * >(model->dualRowPivot());
if (pivot && weights_) {
pivot->fill(*weights_);
}
int numberRows = model->numberRows();
int numberTotal = numberRows + numberColumns;
CoinMemcpyN(status_, numberTotal, model->statusArray());
if (doBoundsEtc < 2) {
CoinMemcpyN(primalSolution_, numberTotal, model->solutionRegion());
CoinMemcpyN(dualSolution_, numberTotal, model->djRegion());
CoinMemcpyN(pivotVariables_, numberRows, model->pivotVariable());
CoinMemcpyN(dualSolution_ + numberColumns, numberRows, model->dualRowSolution());
} else {
CoinMemcpyN(primalSolution_, numberColumns, model->primalColumnSolution());
CoinMemcpyN(dualSolution_, numberColumns, model->dualColumnSolution());
CoinMemcpyN(dualSolution_ + numberColumns, numberRows, model->dualRowSolution());
if (model->columnScale()) {
// See if just primal will work
double *solution = model->primalColumnSolution();
const double *columnScale = model->columnScale();
int i;
for (i = 0; i < numberColumns; i++) {
solution[i] *= columnScale[i];
}
}
}
model->setObjectiveValue(objectiveValue_);
}
}
// Choose a new variable
void ClpNode::chooseVariable(ClpSimplex *, ClpNodeStuff * /*info*/)
{
#if 0
int way = branchState_.firstBranch;
if (branchState_.branch > 0)
way = 1 - way;
assert (!branchState_.branch);
// We need to use pseudo costs to choose a variable
int numberColumns = model->numberColumns();
#endif
}
// Fix on reduced costs
int ClpNode::fixOnReducedCosts(ClpSimplex *)
{
return 0;
}
/* Way for integer variable -1 down , +1 up */
int ClpNode::way() const
{
int way = branchState_.firstBranch;
if (branchState_.branch > 0)
way = 1 - way;
return way == 0 ? -1 : +1;
}
// Return true if branch exhausted
bool ClpNode::fathomed() const
{
return branchState_.branch >= 1;
}
// Change state of variable i.e. go other way
void ClpNode::changeState()
{
branchState_.branch++;
assert(branchState_.branch <= 2);
}
//#############################################################################
// Constructors / Destructor / Assignment
//#############################################################################
//-------------------------------------------------------------------
// Default Constructor
//-------------------------------------------------------------------
ClpNodeStuff::ClpNodeStuff()
: integerTolerance_(1.0e-7)
, integerIncrement_(1.0e-8)
, smallChange_(1.0e-8)
, downPseudo_(NULL)
, upPseudo_(NULL)
, priority_(NULL)
, numberDown_(NULL)
, numberUp_(NULL)
, numberDownInfeasible_(NULL)
, numberUpInfeasible_(NULL)
, saveCosts_(NULL)
, nodeInfo_(NULL)
, large_(NULL)
, whichRow_(NULL)
, whichColumn_(NULL)
,
#ifndef NO_FATHOM_PRINT
handler_(NULL)
,
#endif
nBound_(0)
, saveOptions_(0)
, solverOptions_(0)
, maximumNodes_(0)
, numberBeforeTrust_(0)
, stateOfSearch_(0)
, nDepth_(-1)
, nNodes_(0)
, numberNodesExplored_(0)
, numberIterations_(0)
, presolveType_(0)
#ifndef NO_FATHOM_PRINT
, startingDepth_(-1)
, nodeCalled_(-1)
#endif
{
}
//-------------------------------------------------------------------
// Copy constructor
//-------------------------------------------------------------------
ClpNodeStuff::ClpNodeStuff(const ClpNodeStuff &rhs)
: integerTolerance_(rhs.integerTolerance_)
, integerIncrement_(rhs.integerIncrement_)
, smallChange_(rhs.smallChange_)
, downPseudo_(NULL)
, upPseudo_(NULL)
, priority_(NULL)
, numberDown_(NULL)
, numberUp_(NULL)
, numberDownInfeasible_(NULL)
, numberUpInfeasible_(NULL)
, saveCosts_(NULL)
, nodeInfo_(NULL)
, large_(NULL)
, whichRow_(NULL)
, whichColumn_(NULL)
,
#ifndef NO_FATHOM_PRINT
handler_(rhs.handler_)
,
#endif
nBound_(0)
, saveOptions_(rhs.saveOptions_)
, solverOptions_(rhs.solverOptions_)
, maximumNodes_(rhs.maximumNodes_)
, numberBeforeTrust_(rhs.numberBeforeTrust_)
, stateOfSearch_(rhs.stateOfSearch_)
, nDepth_(rhs.nDepth_)
, nNodes_(rhs.nNodes_)
, numberNodesExplored_(rhs.numberNodesExplored_)
, numberIterations_(rhs.numberIterations_)
, presolveType_(rhs.presolveType_)
#ifndef NO_FATHOM_PRINT
, startingDepth_(rhs.startingDepth_)
, nodeCalled_(rhs.nodeCalled_)
#endif
{
}
//----------------------------------------------------------------
// Assignment operator
//-------------------------------------------------------------------
ClpNodeStuff &
ClpNodeStuff::operator=(const ClpNodeStuff &rhs)
{
if (this != &rhs) {
integerTolerance_ = rhs.integerTolerance_;
integerIncrement_ = rhs.integerIncrement_;
smallChange_ = rhs.smallChange_;
downPseudo_ = NULL;
upPseudo_ = NULL;
priority_ = NULL;
numberDown_ = NULL;
numberUp_ = NULL;
numberDownInfeasible_ = NULL;
numberUpInfeasible_ = NULL;
saveCosts_ = NULL;
nodeInfo_ = NULL;
large_ = NULL;
whichRow_ = NULL;
whichColumn_ = NULL;
nBound_ = 0;
saveOptions_ = rhs.saveOptions_;
solverOptions_ = rhs.solverOptions_;
maximumNodes_ = rhs.maximumNodes_;
numberBeforeTrust_ = rhs.numberBeforeTrust_;
stateOfSearch_ = rhs.stateOfSearch_;
int n = maximumNodes();
if (n) {
for (int i = 0; i < n; i++)
delete nodeInfo_[i];
}
delete[] nodeInfo_;
nodeInfo_ = NULL;
nDepth_ = rhs.nDepth_;
nNodes_ = rhs.nNodes_;
numberNodesExplored_ = rhs.numberNodesExplored_;
numberIterations_ = rhs.numberIterations_;
presolveType_ = rhs.presolveType_;
#ifndef NO_FATHOM_PRINT
handler_ = rhs.handler_;
startingDepth_ = rhs.startingDepth_;
nodeCalled_ = rhs.nodeCalled_;
#endif
}
return *this;
}
// Zaps stuff 1 - arrays, 2 ints, 3 both
void ClpNodeStuff::zap(int type)
{
if ((type & 1) != 0) {
downPseudo_ = NULL;
upPseudo_ = NULL;
priority_ = NULL;
numberDown_ = NULL;
numberUp_ = NULL;
numberDownInfeasible_ = NULL;
numberUpInfeasible_ = NULL;
saveCosts_ = NULL;
nodeInfo_ = NULL;
large_ = NULL;
whichRow_ = NULL;
whichColumn_ = NULL;
}
if ((type & 2) != 0) {
nBound_ = 0;
saveOptions_ = 0;
solverOptions_ = 0;
maximumNodes_ = 0;
numberBeforeTrust_ = 0;
stateOfSearch_ = 0;
nDepth_ = -1;
nNodes_ = 0;
presolveType_ = 0;
numberNodesExplored_ = 0;
numberIterations_ = 0;
}
}
//-------------------------------------------------------------------
// Destructor
//-------------------------------------------------------------------
ClpNodeStuff::~ClpNodeStuff()
{
delete[] downPseudo_;
delete[] upPseudo_;
delete[] priority_;
delete[] numberDown_;
delete[] numberUp_;
delete[] numberDownInfeasible_;
delete[] numberUpInfeasible_;
int n = maximumNodes();
if (n) {
for (int i = 0; i < n; i++)
delete nodeInfo_[i];
}
delete[] nodeInfo_;
#ifdef CLP_INVESTIGATE
// Should be NULL - find out why not?
assert(!saveCosts_);
#endif
delete[] saveCosts_;
}
// Return maximum number of nodes
int ClpNodeStuff::maximumNodes() const
{
int n = 0;
#if 0
if (nDepth_ != -1) {
if ((solverOptions_ & 32) == 0)
n = (1 << nDepth_);
else if (nDepth_)
n = 1;
}
assert (n == maximumNodes_ - (1 + nDepth_) || n == 0);
#else
if (nDepth_ != -1) {
n = maximumNodes_ - (1 + nDepth_);
assert(n > 0);
}
#endif
return n;
}
// Return maximum space for nodes
int ClpNodeStuff::maximumSpace() const
{
return maximumNodes_;
}
/* Fill with pseudocosts */
void ClpNodeStuff::fillPseudoCosts(const double *down, const double *up,
const int *priority,
const int *numberDown, const int *numberUp,
const int *numberDownInfeasible,
const int *numberUpInfeasible,
int number)
{
delete[] downPseudo_;
delete[] upPseudo_;
delete[] priority_;
delete[] numberDown_;
delete[] numberUp_;
delete[] numberDownInfeasible_;
delete[] numberUpInfeasible_;
downPseudo_ = CoinCopyOfArray(down, number);
upPseudo_ = CoinCopyOfArray(up, number);
priority_ = CoinCopyOfArray(priority, number);
numberDown_ = CoinCopyOfArray(numberDown, number);
numberUp_ = CoinCopyOfArray(numberUp, number);
numberDownInfeasible_ = CoinCopyOfArray(numberDownInfeasible, number);
numberUpInfeasible_ = CoinCopyOfArray(numberUpInfeasible, number);
// scale
for (int i = 0; i < number; i++) {
int n;
n = numberDown_[i];
if (n)
downPseudo_[i] *= n;
n = numberUp_[i];
if (n)
upPseudo_[i] *= n;
}
}
// Update pseudo costs
void ClpNodeStuff::update(int way, int sequence, double change, bool feasible)
{
assert(numberDown_[sequence] >= numberDownInfeasible_[sequence]);
assert(numberUp_[sequence] >= numberUpInfeasible_[sequence]);
if (way < 0) {
numberDown_[sequence]++;
if (!feasible)
numberDownInfeasible_[sequence]++;
downPseudo_[sequence] += CoinMax(change, 1.0e-12);
} else {
numberUp_[sequence]++;
if (!feasible)
numberUpInfeasible_[sequence]++;
upPseudo_[sequence] += CoinMax(change, 1.0e-12);
}
}
//#############################################################################
// Constructors / Destructor / Assignment
//#############################################################################
//-------------------------------------------------------------------
// Default Constructor
//-------------------------------------------------------------------
ClpHashValue::ClpHashValue()
: hash_(NULL)
, numberHash_(0)
, maxHash_(0)
, lastUsed_(-1)
{
}
//-------------------------------------------------------------------
// Useful Constructor from model
//-------------------------------------------------------------------
ClpHashValue::ClpHashValue(ClpSimplex *model)
: hash_(NULL)
, numberHash_(0)
, maxHash_(0)
, lastUsed_(-1)
{
maxHash_ = 1000;
int numberColumns = model->numberColumns();
const double *columnLower = model->columnLower();
const double *columnUpper = model->columnUpper();
int numberRows = model->numberRows();
const double *rowLower = model->rowLower();
const double *rowUpper = model->rowUpper();
const double *objective = model->objective();
CoinPackedMatrix *matrix = model->matrix();
const int *columnLength = matrix->getVectorLengths();
const CoinBigIndex *columnStart = matrix->getVectorStarts();
const double *elementByColumn = matrix->getElements();
int i;
int ipos;
hash_ = new CoinHashLink[maxHash_];
for (i = 0; i < maxHash_; i++) {
hash_[i].value = -1.0e-100;
hash_[i].index = -1;
hash_[i].next = -1;
}
// Put in +0
hash_[0].value = 0.0;
hash_[0].index = 0;
numberHash_ = 1;
/*
* Initialize the hash table. Only the index of the first value that
* hashes to a value is entered in the table; subsequent values that
* collide with it are not entered.
*/
for (i = 0; i < numberColumns; i++) {
int length = columnLength[i];
CoinBigIndex start = columnStart[i];
for (CoinBigIndex i = start; i < start + length; i++) {
double value = elementByColumn[i];
ipos = hash(value);
if (hash_[ipos].index == -1) {
hash_[ipos].index = numberHash_;
numberHash_++;
hash_[ipos].value = elementByColumn[i];
}
}
}