- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- File List
- File Members

BlisBranchStrategyMaxInf.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-2013, Lehigh University, Yan Xu, and Ted Ralphs. *
21 * All Rights Reserved. *
22 *===========================================================================*/
23
24 #ifndef BlisBranchStrategyMaxInf_h_
25 #define BlisBranchStrategyMaxInf_h_
26
27 #include "BcpsBranchObject.h"
28 #include "BcpsBranchStrategy.h"
29 #include "BlisModel.h"
30
32 class BlisBranchStrategyMaxInf : public BcpsBranchStrategy {
33
34 private:
35
37 BlisBranchStrategyMaxInf& operator=(const BlisBranchStrategyMaxInf& rhs);
38
39 public:
40
42 BlisBranchStrategyMaxInf() {
43 type_ = static_cast<int>(BlisBranchingStrategyMaxInfeasibility);
44 }
45
47 BlisBranchStrategyMaxInf(BlisModel *model) : BcpsBranchStrategy(model) {
48 type_ = static_cast<int>(BlisBranchingStrategyMaxInfeasibility);
49 }
50
52 virtual ~BlisBranchStrategyMaxInf() {}
53
55 BlisBranchStrategyMaxInf(const BlisBranchStrategyMaxInf &);
56
58 virtual BcpsBranchStrategy * clone() const {
59 return new BlisBranchStrategyMaxInf(*this);
60 }
61
63 virtual int createCandBranchObjects(int numPassesLeft, double ub);
64
70 virtual int betterBranchObject(BcpsBranchObject * thisOne,
71 BcpsBranchObject * bestSoFar);
72 };
73
74 #endif
BlisModel
Definition: BlisModel.h:60
BlisBranchingStrategyMaxInfeasibility
Definition: Blis.h:103
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf
BlisBranchStrategyMaxInf()
MaxInf Constructor.
Definition: BlisBranchStrategyMaxInf.h:42
BlisBranchStrategyMaxInf::betterBranchObject
virtual int betterBranchObject(BcpsBranchObject *thisOne, BcpsBranchObject *bestSoFar)
Compare branching object thisOne to bestSoFar.
BcpsBranchStrategy.h
BcpsBranchObject
BcpsBranchObject contains the member data required when choosing branching entities and excuting actu...
Definition: BcpsBranchObject.h:47
BcpsBranchStrategy::type_
int type_
Type of branching strategy.
Definition: BcpsBranchStrategy.h:48
BlisBranchStrategyMaxInf
This class implements maximum infeasibility branching.
Definition: BlisBranchStrategyMaxInf.h:32
BlisBranchStrategyMaxInf::clone
virtual BcpsBranchStrategy * clone() const
Clone a brancing strategy.
Definition: BlisBranchStrategyMaxInf.h:58
BlisBranchStrategyMaxInf::BlisBranchStrategyMaxInf
BlisBranchStrategyMaxInf(BlisModel *model)
MaxInf Constructor.
Definition: BlisBranchStrategyMaxInf.h:47
BlisBranchStrategyMaxInf::~BlisBranchStrategyMaxInf
virtual ~BlisBranchStrategyMaxInf()
Destructor.
Definition: BlisBranchStrategyMaxInf.h:52
BlisBranchStrategyMaxInf::operator=
BlisBranchStrategyMaxInf & operator=(const BlisBranchStrategyMaxInf &rhs)
Illegal Assignment operator.
BcpsBranchStrategy
Branching strategy specifies: (1) how to select a candidate set of branching objects (2) how to compa...
Definition: BcpsBranchStrategy.h:39
BlisModel.h
BlisBranchStrategyMaxInf::createCandBranchObjects
virtual int createCandBranchObjects(int numPassesLeft, double ub)
Create a set of candidate branching objects.
BcpsBranchObject.h