base_brancher.hpp

Go to the documentation of this file.

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */  /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#ifndef CMR_BASE_BRANCHER_H
#define CMR_BASE_BRANCHER_H

#include "exec_branch.hpp"
#include "datagroups.hpp"
#include "active_tour.hpp"
#include "branch_util.hpp"

#include <list>
#include <vector>

namespace CMR {
namespace ABC {

class BaseBrancher {
public:
    BaseBrancher(const Data::Instance &inst, const Data::BestGroup &bestdata,
                 const Graph::CoreGraph &coregraph, LP::CoreLP &core);

    virtual ~BaseBrancher() = default;

    virtual BranchHistory::iterator next_prob() = 0;

    void split_prob(BranchHistory::iterator &current);

    void do_branch(const BranchNode &B);

    void do_unbranch(const BranchNode &B);

    const BranchHistory &get_history() { return branch_history; }

    int verbose = 0;

protected:
    virtual void enqueue_split(BranchNode::Split prob_array) = 0;

    void common_prep_next(const BranchNode &done, const BranchNode &next);

    bool prune_btour_edges(const BranchNode &done, const BranchNode &next,
                           const BranchNode &common_anc);

    virtual void fetch_next() = 0;

    const Data::Instance &instance;
    const Data::BestGroup &best_data;
    const Graph::CoreGraph &core_graph;
    LP::CoreLP &core_lp;

    BranchTourFind btour_find;

    Executor exec;
    BranchHistory branch_history;

    BranchHistory::iterator next_itr;
};

}
}
#endif