Camargue
|
ABC search nodes. More...
#include "lp_util.hpp"
#include "util.hpp"
#include <array>
#include <iostream>
#include <list>
#include <utility>
Go to the source code of this file.
Classes | |
struct | CMR::ABC::BranchNode |
Namespaces | |
CMR | |
The namespace for this project. | |
CMR::ABC | |
Augment-Branch-Cut solution. | |
Typedefs | |
using | CMR::ABC::BranchHistory = std::list< BranchNode > |
using | CMR::ABC::EndsDir = std::pair< EndPts, BranchNode::Dir > |
Alias declaration for EndPts and branching direction. | |
Functions | |
BranchNode::Dir | CMR::ABC::dir_from_int (int entry) |
Turn a 0-1 value entry into a BranchNode::Dir. | |
std::string | CMR::ABC::bnode_brief (const BranchNode &B) |
A concise "label" for the BranchNode B . | |
std::ostream & | CMR::ABC::operator<< (std::ostream &os, const BranchNode::Dir &dir) |
std::ostream & | CMR::ABC::operator<< (std::ostream &os, const BranchNode &B) |
ABC search nodes.
This file contains the structure representing branching subproblems to be examined, and various comparator functions for implementing node selection rules. There are also some I/O utility functions.