core_lp.hpp

Go to the documentation of this file.

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

#ifndef CMR_CORE_LP_H
#define CMR_CORE_LP_H

#include "lp_interface.hpp"
#include "active_tour.hpp"
#include "cc_lpcuts.hpp"
#include "process_cuts.hpp"
#include "datagroups.hpp"
#include "hypergraph.hpp"
#include "util.hpp"

#include <algorithm>
#include <utility>
#include <vector>

namespace CMR {

class Solver;

namespace LP {


class CoreLP : public Relaxation {
public:
    CoreLP(Graph::CoreGraph &core_graph_, Data::BestGroup &best_data_);

    LP::PivType primal_pivot();

    void pivot_back(bool prune_slacks); 


    void add_cuts(Sep::LPcutList &cutq);
    void add_cuts(Sep::CutQueue<Sep::dominoparity> &dp_q);
    void add_cuts(Sep::CutQueue<LP::SparseRow> &gmi_q);
    void add_cuts(Sep::CutQueue<Sep::ex_blossom> &ex2m_q);
    void add_cuts(Sep::CutQueue<Sep::HyperGraph> &pool_q);


    void add_edges(const std::vector<Graph::Edge> &add_batch,
                   bool reinstate);

    void remove_edges(std::vector<int> edge_delstat, bool reinstate);


    template<typename numtype>
    bool check_feas(const std::vector<numtype> &x_vec);

    const Data::SupportGroup &support_data() const { return supp_data; }
    const Sep::ExternalCuts &external_cuts() const { return ext_cuts; }
    const LP::ActiveTour &get_active_tour() const { return active_tour; }

    void set_active_tour(std::vector<int> tour_nodes);

    void tourless_mode(); 

    int avg_itcount() const { return sum_it_count / num_nd_pivots; }

    double active_tourlen() const { return active_tour.length(); }

    double global_ub() const { return best_data.min_tour_value; }

    bool verbose = false;

    friend class CMR::Solver;

private:
    void instate_active();

    void reset_instate_active();

    void handle_aug_pivot(std::vector<int> tour_nodes, Basis aug_base);

    void prune_slacks(); 

    void purge_gmi(bool instate); 

    Graph::CoreGraph &core_graph;
    Data::BestGroup &best_data;
    Data::SupportGroup supp_data;

    Sep::ExternalCuts ext_cuts;

    ActiveTour active_tour;

    std::vector<double> lp_edges;
    std::vector<double> pi_vals;
    std::vector<double> feas_stat;

    int num_nd_pivots = 0;
    int sum_it_count = 0;

    int prev_numrows;

    bool steepest_engaged = false;
};


}
}

#endif