Blis 0.94
Loading...
Searching...
No Matches
BlisSubTree.h
Go to the documentation of this file.
1/*===========================================================================*
2 * This file is part of the BiCePS Linear Integer Solver (BLIS). *
3 * *
4 * BLIS 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-2019, Lehigh University, Yan Xu, and Ted Ralphs. *
21 * All Rights Reserved. *
22 *===========================================================================*/
23
24#ifndef BlisSubTree_h_
25#define BlisSubTree_h_
26
27//#############################################################################
31//#############################################################################
32
33class BlisTreeNode : public BcpsTreeNode {
34
35 virtual void process();
36
41 void branch(AlpsTreeNode& explicitNode);
42
45 virtual bool fathom();
46
47};
48
49//#############################################################################
50//#############################################################################
51
52#endif
This is the class in which we are finally able to concretely define the bounding procedure.
Definition BlisSubTree.h:33
virtual std::vector< CoinTriple< AlpsNodeDesc *, AlpsNodeStatus, double > > branch()
Takes the explicit description of the current active node and creates the children's descriptions,...