Camargue
|
Functions, structs/enums, and constants for branching. More...
#include "graph.hpp"
#include "lp_util.hpp"
#include "util.hpp"
#include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
Go to the source code of this file.
Classes | |
struct | CMR::ABC::ScoreTuple |
Namespaces | |
CMR | |
The namespace for this project. | |
CMR::ABC | |
Augment-Branch-Cut solution. | |
CMR::ABC::SB | |
Constants related to branch selection. | |
Functions | |
int | CMR::ABC::SB::round1_limit (int avg_itcount) |
int | CMR::ABC::SB::round2_limit (int avg_itcount) |
int | CMR::ABC::large_len (int ncount, const std::vector< Graph::Edge > &edges) |
Return a "large" edge length relative to the capacities in ecap . | |
double | CMR::ABC::var_score (double mult, double v0, double v1) |
Rank a branching variable in terms of its down and up estimates. More... | |
std::vector< int > | CMR::ABC::length_weighted_cands (const std::vector< Graph::Edge > &edges, const std::vector< int > &indices, const std::vector< double > &x, const int num_return) |
Get a list of candidate branch edges using fractional long edge branching. | |
std::ostream & | CMR::ABC::operator<< (std::ostream &os, const ScoreTuple &T) |
std::vector< ScoreTuple > | CMR::ABC::ranked_cands (const std::vector< int > &cand_inds, std::vector< LP::Estimate > &down_est, std::vector< LP::Estimate > &up_est, const std::vector< Graph::Edge > &edges, std::vector< LP::Basis > &contra_bases, double mult, double ub, int num_return) |
Produce a list of fixed max size containing ranked scored branching edges. | |
Functions, structs/enums, and constants for branching.