pricer_vrp.h
Go to the documentation of this file.
86 /** return negative reduced cost tour (uses restricted shortest path dynamic programming algorithm) */
Definition: pricer_vrp.h:46
virtual SCIP_DECL_PRICERINIT(scip_init)
ObjPricerVRP(SCIP *scip, const char *p_name, const int p_num_nodes, const int p_capacity, const vector< int > &p_demand, const vector< vector< int > > &p_distance, const vector< vector< SCIP_VAR * > > &p_arc_var, const vector< vector< SCIP_CONS * > > &p_arc_con, const vector< SCIP_CONS * > &p_part_con)
Definition: pricer_vrp.cpp:50
virtual SCIP_DECL_PRICERREDCOST(scip_redcost)
SCIP_RETCODE pricing(SCIP *scip, bool isfarkas) const
Definition: pricer_vrp.cpp:106
virtual SCIP_DECL_PRICERFARKAS(scip_farkas)
SCIP_RETCODE add_tour_variable(SCIP *scip, const list< int > &tour) const
Definition: pricer_vrp.cpp:258
SCIP_CONS * arc_con(const int i, const int j) const
Definition: pricer_vrp.h:134
double find_shortest_tour(const vector< vector< double > > &length, list< int > &tour) const
Definition: pricer_vrp.cpp:373
Definition: objbenders.h:44
Definition: pqueue.h:38
C++ wrapper classes for SCIP.
public methods for problem variables
Definition: struct_cons.h:47
Definition: struct_var.h:208
Definition: struct_scip.h:70