abc_nodesel.hpp

Go to the documentation of this file.

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */  /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#ifndef CMR_ABC_NODESEL_H
#define CMR_ABC_NODESEL_H

#include "datagroups.hpp"
#include "active_tour.hpp"
#include "branch_node.hpp"
#include "base_brancher.hpp"
#include "qpref_brancher.hpp"

#include <vector>

namespace CMR {
namespace ABC {

class DFSbrancher : public BaseBrancher {
public:
    DFSbrancher(const Data::Instance &inst, const Data::BestGroup &best_data,
                const Graph::CoreGraph &core_graph, LP::CoreLP &core_lp);

    BranchHistory::iterator next_prob();

protected:
    void fetch_next();

    void enqueue_split(BranchNode::Split prob_array);
};

using TourBrancher = QprefBrancher<BranchNode::tour_worse>;

using BoundBrancher = QprefBrancher<BranchNode::bound_worse>;

class InterBrancher : public BaseBrancher {
public:
    InterBrancher(const Data::Instance &inst, const Data::BestGroup &best_data,
                  const Graph::CoreGraph &core_graph, LP::CoreLP &core_lp);

    BranchHistory::iterator next_prob();

protected:
    void fetch_next();
    void enqueue_split(BranchNode::Split prob_array);

private:
    static constexpr int BestFreq = 10;
    int node_num = 1;


    static void heap_push(std::vector<BranchHistory::iterator> &target_q,
                          BranchHistory::iterator itr);

    static void heap_make(std::vector<BranchHistory::iterator> &target_q);

    static void heap_pop(std::vector<BranchHistory::iterator> &target_q);

    static bool better_bound(const BranchHistory::iterator &A,
                           const BranchHistory::iterator &B)
        { return A->estimate < B->estimate; }


    std::vector<BranchHistory::iterator> prob_q;
};

}
}

#endif