Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://scip.zib.de/doc/html/pricer__vrp_8cpp_source.php below:

SCIP Doxygen Documentation: examples/VRP/src/pricer_vrp.cpp Source File

p_num_nodes,

vector< int >& p_demand,

vector< vector<int> >& p_distance,

vector< vector<SCIP_VAR*> >& p_arc_var,

vector< vector<SCIP_CONS*> >& p_arc_con,

vector<SCIP_CONS* >& p_part_con

_num_nodes(p_num_nodes),

_capacity(p_capacity),

_distance(p_distance),

(

i = 0; i < num_nodes(); ++i)

(

j = 0; j < i; ++j)

(

i = 1; i < num_nodes(); ++i)

vector< vector<SCIP_Real> > red_length(

());

red_length[i].resize(i, 0.0);

assert( i == 0 ||

(i) != 0 );

(

j = 0; j < i; ++j)

red_length[i][j] =

;

assert( i == 0 ||

(i) != 0 );

(

j = 0; j < i; ++j)

red_length[i][j] =

;

(

j = 0; j < i; ++j)

(

j = 0; j < i; ++j)

(

j = 0; j < i; ++j)

(

j = 0; j < i; ++j)

list<int>& tour

(list<int>::const_iterator it = tour.begin(); it != tour.end(); ++it)

strncpy(tmp_name, var_name, 255);

(void)

(var_name, 255,

, tmp_name, *it);

(list<int>::const_iterator it = tour.begin(); it != tour.end(); ++it)

assert( 0 <= *it && *it <

() );

(list<int>::const_iterator it = tour.begin(); it != tour.end(); ++it)

assert( 0 <= *it && *it <

() );

PQUEUE_KEY() : demand(0), length(0.0) {}

operator< (

PQUEUE_KEY& l1,

PQUEUE_KEY& l2)

( l1.demand < l2.demand )

( l1.demand > l2.demand )

( l1.length < l2.length-

)

PQUEUE_DATA;

PQUEUE::pqueue_item PQUEUE_ITEM;

NODE_TABLE_DATA

PQUEUE::pqueue_item queue_item;

NODE_TABLE_DATA( ) : length(0.0), predecessor(-1), queue_item(

) {}

NODE_TABLE_KEY;

std::map< NODE_TABLE_KEY, NODE_TABLE_DATA > NODE_TABLE;

vector< vector<SCIP_Real> >& length,

vector< NODE_TABLE > table(

());

PQUEUE_KEY queue_key;

PQUEUE_DATA queue_data = 0;

PQUEUE_ITEM queue_item = PQ.insert(queue_key, queue_data);

NODE_TABLE_KEY table_key = 0;

NODE_TABLE_DATA table_entry;

( ! PQ.empty() )

queue_item = PQ.top();

queue_key = PQ.get_key (queue_item);

queue_data = PQ.get_data(queue_item);

curr_node = queue_data;

curr_length = queue_key.length;

curr_demand = queue_key.demand;

( curr_node == 0 && curr_length < -

)

( curr_node == 0 && curr_demand != 0 )

(

next_node = 0; next_node <

(); ++next_node)

( next_node == curr_node )

(

( next_node, curr_node ) == false )

next_demand = curr_demand +

(next_node);

next_length = curr_length + ( curr_node > next_node ?

length[curr_node][next_node] :

length[next_node][curr_node] );

NODE_TABLE& next_table = table[next_node];

list<NODE_TABLE::iterator> dominated;

(NODE_TABLE::iterator it = next_table.begin(); it != next_table.end() && ! skip; ++it)

( next_demand >= it->first && next_length >= it->second.length -

)

( next_demand <= it->first && next_length <= it->second.length +

)

dominated.push_front( it );

(list<NODE_TABLE::iterator>::iterator it = dominated.begin(); it != dominated.end(); ++it)

PQ.remove( (*it)->second.queue_item );

next_table.erase( *it );

queue_key.demand = next_demand;

queue_key.length = next_length;

queue_data = next_node;

queue_item = PQ.insert(queue_key, queue_data);

table_key = next_demand;

table_entry.length = next_length;

table_entry.predecessor = curr_node;

table_entry.queue_item = queue_item;

next_table[table_key] = table_entry;

printf(

, next_node, next_demand, next_length, curr_node);

table_entry.predecessor = -1;

table_entry.length = 0;

(NODE_TABLE::iterator it = table[0].begin(); it != table[0].end(); ++it)

( it->second.length < table_entry.length )

table_key = it->first;

table_entry = it->second;

tour_length = table_entry.length;

( table_entry.predecessor > 0 )

table_key -=

(curr_node);

curr_node = table_entry.predecessor;

tour.push_front(curr_node);

table_entry = table[curr_node][table_key];

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)

SCIP_RETCODE pricing(SCIP *scip, bool isfarkas) const

bool have_edge(const int i, const int j) const

SCIP_RETCODE add_tour_variable(SCIP *scip, const list< int > &tour) const

SCIP_CONS * arc_con(const int i, const int j) const

int demand(const int i) const

double find_shortest_tour(const vector< vector< double > > &length, list< int > &tour) const

SCIP_CONS * part_con(const int i) const

C++ wrapper for variable pricer.

Constraint handler for linear constraints in their most general form, .

SCIP_Real SCIPgetDualsolLinear(SCIP *scip, SCIP_CONS *cons)

SCIP_RETCODE SCIPaddCoefLinear(SCIP *scip, SCIP_CONS *cons, SCIP_VAR *var, SCIP_Real val)

SCIP_Real SCIPgetDualfarkasLinear(SCIP *scip, SCIP_CONS *cons)

SCIP_RETCODE SCIPaddPricedVar(SCIP *scip, SCIP_VAR *var, SCIP_Real score)

SCIP_RETCODE SCIPwriteTransProblem(SCIP *scip, const char *filename, const char *extension, SCIP_Bool genericnames)

void SCIPinfoMessage(SCIP *scip, FILE *file, const char *formatstr,...)

SCIP_RETCODE SCIPgetTransformedCons(SCIP *scip, SCIP_CONS *cons, SCIP_CONS **transcons)

SCIP_Real SCIPinfinity(SCIP *scip)

SCIP_Bool SCIPisNegative(SCIP *scip, SCIP_Real val)

SCIP_RETCODE SCIPreleaseVar(SCIP *scip, SCIP_VAR **var)

SCIP_RETCODE SCIPcreateVar(SCIP *scip, SCIP_VAR **var, const char *name, SCIP_Real lb, SCIP_Real ub, SCIP_Real obj, SCIP_VARTYPE vartype, SCIP_Bool initial, SCIP_Bool removable, SCIP_DECL_VARDELORIG((*vardelorig)), SCIP_DECL_VARTRANS((*vartrans)), SCIP_DECL_VARDELTRANS((*vardeltrans)), SCIP_DECL_VARCOPY((*varcopy)), SCIP_VARDATA *vardata)

SCIP_RETCODE SCIPgetTransformedVar(SCIP *scip, SCIP_VAR *var, SCIP_VAR **transvar)

int SCIPsnprintf(char *t, int len, const char *s,...)

class for priority queues

SCIP_DECL_PRICERINIT(ObjPricerVRP::scip_init)

SCIP_DECL_PRICERREDCOST(ObjPricerVRP::scip_redcost)

SCIP_DECL_PRICERFARKAS(ObjPricerVRP::scip_farkas)

enum SCIP_Retcode SCIP_RETCODE

@ SCIP_VARTYPE_CONTINUOUS

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4