node.h

Go to the documentation of this file.

// Copyright (C) 2006 Ivo Nowak and Stefan Vigerske
// All Rights Reserved.
// This code is published under the Common Public License.
//
// Author: Stefan Vigerske

#ifndef NODE_H
#define NODE_H

#include "standard.h"
#include "problem.h"
#include "minlpopt.h"
#include "bcp.h"

class ColumnGenerator;
class RMPManager;
class LinearRelax;
class LinearRelaxSolverGeneral;
class LinearRelaxSolverMIP;
class LagHeu;
class LagHeu1;
class LagHeu_SimAnnealing;
class LagHeu2;
class LagHeu2b;

class MinlpNode {
        friend class MinlpBCP;
        friend class ColumnGenerator;
        friend class RMPManager;
        friend class LinearRelax;
        friend class LinearRelaxSolverGeneral;
        friend class LinearRelaxSolverMIP;
        friend class RelaxationSolver;
        friend class LagHeu;
        friend class LagHeu1;
        friend class LagHeu_SimAnnealing;
        friend class LagHeu2;
        friend class LagHeu2b;

  private:
                double low_bound;

                bool update_subdiv_bound_called;

//              map<int, set<int> > bcp_fixed_var;

//              vector<list<Pointer<SepQcFunc> > > part_con;

                dvector lower, upper;

                set<int> fix_branch_var;

                vector<dvector> lagprob_solutions;

                dvector ref_point;

                dvector dual_point;

                dvector yz_RMP;

                vector<list<list<ExtremePoint>::iterator> > i_ExtremePoints;
                vector<list<ExtremePoint>::iterator> i_ExtremePoints_limit;

        public:
                MinlpNode(const dvector& lower_, const dvector& upper_/*, const map<int, set<int> >& already_fixed/*=map<int, set<int> >*/);

                MinlpNode(MinlpNode& node);

                pair<double, pair<int,int> > bcp_rho(const dvector& x, const vector<ivector>& block, const vector<bool>& discr);

                bool inside_part_set(dvector &point, int k, const vector<ivector>& block);

                set<SolCandidate>::const_iterator outside_part_set(const set<SolCandidate>& points);

                double key() { return low_bound; }
                
                double key(const vector<int>& i_discr);

};

//------------------------------------------

#endif

---