Blis 0.95.0
Loading...
Searching...
No Matches
BlisBranchStrategyStrong.h
Go to the documentation of this file.
1/*===========================================================================*
2 * This file is part of the BiCePS Linear Integer Solver (BLIS). *
3 * *
4 * ALPS is distributed under the Eclipse Public License as part of the *
5 * COIN-OR repository (http://www.coin-or.org). *
6 * *
7 * Authors: *
8 * *
9 * Yan Xu, Lehigh University *
10 * Ted Ralphs, Lehigh University *
11 * *
12 * Conceptual Design: *
13 * *
14 * Yan Xu, Lehigh University *
15 * Ted Ralphs, Lehigh University *
16 * Laszlo Ladanyi, IBM T.J. Watson Research Center *
17 * Matthew Saltzman, Clemson University *
18 * *
19 * *
20 * Copyright (C) 2001-2023, Lehigh University, Yan Xu, and Ted Ralphs. *
21 * All Rights Reserved. *
22 *===========================================================================*/
23
24
25//#############################################################################
26// NOTE: Borrow ideas from COIN/Cbc
27//#############################################################################
28
29
30#ifndef BlisBranchStrategyStrong_h_
31#define BlisBranchStrategyStrong_h_
32
33#include "BcpsBranchObject.h"
34#include "BcpsBranchStrategy.h"
35#include "BlisConfig.h"
36#include "BlisModel.h"
37
38
39//#############################################################################
40
41
42typedef struct {
43 int objectIndex; // object index
44 BcpsBranchObject * bObject; // the branching object
45 int numIntInfUp; // without odd ones
46 int numObjInfUp; // just odd ones
47 bool finishedUp; // true if solver finished
48 int numIntInfDown; // without odd ones
49 int numObjInfDown; // just odd ones
50 bool finishedDown; // true if solver finished
52
53
54//#############################################################################
55
56
58class BLISLIB_EXPORT BlisBranchStrategyStrong : public BcpsBranchStrategy {
59
60 private:
61
64
65 public:
66
69 type_ = static_cast<int>(BlisBranchingStrategyStrong);
70 }
71
74 : BcpsBranchStrategy(model) {
75 type_ = static_cast<int>(BlisBranchingStrategyStrong);
76 }
77
80
83
85 virtual BcpsBranchStrategy * clone() const {
86 return new BlisBranchStrategyStrong(*this);
87 }
88
90 virtual int createCandBranchObjects(int numPassesLeft, double ub);
91
97 virtual int betterBranchObject(BcpsBranchObject * thisOne,
98 BcpsBranchObject * bestSoFar);
99};
100
101#endif
@ BlisBranchingStrategyStrong
Definition Blis.h:106
virtual ~BlisBranchStrategyStrong()
Destructor.
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
BlisBranchStrategyStrong()
Strong Constructor.
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
BlisBranchStrategyStrong(const BlisBranchStrategyStrong &)
Copy constructor.
BlisBranchStrategyStrong(BlisModel *model)
Strong Constructor.
#define BLISLIB_EXPORT
Definition config.h:5
BcpsBranchObject * bObject