Bcp  1.4.4
Class Hierarchy
This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 123456]
 Cstd::allocator< T >STL class
 Cstd::array< T >STL class
 Cstd::auto_ptr< T >STL class
 Cstd::basic_string< Char >STL class
 Cstd::basic_string< char >
 Cstd::basic_string< wchar_t >
 CBCP_buffer
This class describes the message buffer used for all processes of BCP
 CBCP_cg_parParameters used in the Cut Generator process
 CBCP_fatal_errorCurrently there isn't any error handling in BCP
 CBCP_internal_brobjThis class is the internal representation of a branching object
 CBCP_lp_branching_objectThis class describes a generic branching object
 CBCP_lp_nodeNO OLD DOC
 CBCP_lp_parParameters used in the LP process
 CBCP_lp_parentNO OLD DOC
 CBCP_lp_resultThis class holds the results after solving an LP relaxation
 CBCP_lp_statisticsNO OLD DOC
 CBCP_lp_waiting_col
 CBCP_lp_waiting_row
 CBCP_MemPool
 CBCP_message_environmentThis is an abstract base class that describes the message passing environment
 CBCP_node_storage_in_tmNO OLD DOC
 CBCP_obj_change
 CBCP_obj_set_changeThis class stores data about how an object set (set of vars or set of cuts) changes
 CBCP_parameterThis parameter indeintifies a single parameter entry
 CBCP_presolved_lp_brobjA presolved branching object candidate
 CBCP_problem_coreThis class describes the core of the MIP problem, the variables/cuts in it as well as the matrix corresponding the core variables and cuts
 CBCP_problem_core_changeThis class describes changes in the core of the problem
 CBCP_process
 CBCP_scheduler
 CBCP_slave_paramsNO OLD DOC
 CBCP_solutionThis is the abstract base class for a solution to a Mixed Integer Programming problem
 CBCP_stringThis class is a very simple impelementation of a constant length string
 CBCP_tm_flagsNO OLD DOC
 CBCP_tm_node_data
 CBCP_tm_node_to_send
 CBCP_tm_parParameters used in the Tree Manager process
 CBCP_tm_stat
 CBCP_treeNO OLD DOC
 CBCP_ts_node_dataSame as BCP_tm_node_data, just there's no need to use smart pointers in this process
 CBCP_ts_par
 CBCP_user_class
 CBCP_user_pack
 CBCP_vec< T >The class BCP_vec serves the same purpose as the vector class in the standard template library
 CBCP_vec< BCP_child_action >
 CBCP_vec< BCP_col *>
 CBCP_vec< BCP_cut *>
 CBCP_vec< BCP_cut_core *>
 CBCP_vec< BCP_lp_result *>
 CBCP_vec< BCP_lp_waiting_col *>
 CBCP_vec< BCP_lp_waiting_row *>
 CBCP_vec< BCP_obj_change >
 CBCP_vec< BCP_row *>
 CBCP_vec< BCP_string >
 CBCP_vec< BCP_tm_node *>
 CBCP_vec< BCP_user_data *>
 CBCP_vec< BCP_var *>
 CBCP_vec< BCP_var_core *>
 CBCP_vec< BCP_vec< BCP_cut *> >
 CBCP_vec< BCP_vec< BCP_row *> >
 CBCP_vec< char >
 CBCP_vec< Coin::SmartPtr< BCP_cut > >
 CBCP_vec< Coin::SmartPtr< BCP_var > >
 CBCP_vec< double >
 CBCP_vec< int >
 CBCP_vec< std::pair< BCP_string, BCP_parameter > >
 CBCP_vec< std::pair< int, int > >
 CBCP_vec_change< T >This class stores a vector explicitly or relatively to another vector
 CBCP_vec_change< char >
 CBCP_vec_change< double >
 CBCP_vg_par
 CBCP_warmstartWarmstarting information for the LP solver
 Cstd::bitset< Bits >STL class
 CCoinPackedMatrix
 CCoinPackedVector
 CCoinTreeNode
 Cstd::complexSTL class
 Cstd::list< T >::const_iteratorSTL iterator class
 Cstd::forward_list< T >::const_iteratorSTL iterator class
 Cstd::map< K, T >::const_iteratorSTL iterator class
 Cstd::unordered_map< K, T >::const_iteratorSTL iterator class
 Cstd::wstring::const_iteratorSTL iterator class
 Cstd::basic_string< Char >::const_iteratorSTL iterator class
 Cstd::multimap< K, T >::const_iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::const_iteratorSTL iterator class
 Cstd::set< K >::const_iteratorSTL iterator class
 Cstd::string::const_iteratorSTL iterator class
 Cstd::unordered_set< K >::const_iteratorSTL iterator class
 Cstd::multiset< K >::const_iteratorSTL iterator class
 Cstd::unordered_multiset< K >::const_iteratorSTL iterator class
 Cstd::vector< T >::const_iteratorSTL iterator class
 Cstd::deque< T >::const_iteratorSTL iterator class
 Cstd::unordered_set< K >::const_reverse_iteratorSTL iterator class
 Cstd::list< T >::const_reverse_iteratorSTL iterator class
 Cstd::forward_list< T >::const_reverse_iteratorSTL iterator class
 Cstd::map< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::unordered_map< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::unordered_multiset< K >::const_reverse_iteratorSTL iterator class
 Cstd::multimap< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::multiset< K >::const_reverse_iteratorSTL iterator class
 Cstd::string::const_reverse_iteratorSTL iterator class
 Cstd::basic_string< Char >::const_reverse_iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::const_reverse_iteratorSTL iterator class
 Cstd::set< K >::const_reverse_iteratorSTL iterator class
 Cstd::wstring::const_reverse_iteratorSTL iterator class
 Cstd::vector< T >::const_reverse_iteratorSTL iterator class
 Cstd::deque< T >::const_reverse_iteratorSTL iterator class
 Cstd::deque< T >STL class
 Cstd::error_categorySTL class
 Cstd::error_codeSTL class
 Cstd::error_conditionSTL class
 Cstd::exceptionSTL class
 Cstd::forward_list< T >STL class
 Cstd::ios_baseSTL class
 Cstd::wstring::iteratorSTL iterator class
 Cstd::multiset< K >::iteratorSTL iterator class
 Cstd::list< T >::iteratorSTL iterator class
 Cstd::forward_list< T >::iteratorSTL iterator class
 Cstd::vector< T >::iteratorSTL iterator class
 Cstd::map< K, T >::iteratorSTL iterator class
 Cstd::unordered_map< K, T >::iteratorSTL iterator class
 Cstd::basic_string< Char >::iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::iteratorSTL iterator class
 Cstd::string::iteratorSTL iterator class
 Cstd::set< K >::iteratorSTL iterator class
 Cstd::unordered_set< K >::iteratorSTL iterator class
 Cstd::multimap< K, T >::iteratorSTL iterator class
 Cstd::unordered_multiset< K >::iteratorSTL iterator class
 Cstd::deque< T >::iteratorSTL iterator class
 Cstd::list< T >STL class
 Cstd::map< K, T >STL class
 Cstd::map< int, BCP_cut_algo *>
 Cstd::map< int, BCP_process *>
 Cstd::map< int, BCP_tm_node *>
 Cstd::map< int, BCP_tm_node_to_send *>
 Cstd::map< int, BCP_ts_node_data *>
 Cstd::map< int, BCP_var_algo *>
 Cstd::map< int, Coin::SmartPtr< BCP_cut > >
 Cstd::map< int, Coin::SmartPtr< BCP_var > >
 Cstd::map< int, double >
 Cstd::map< int, int >
 Cstd::multimap< K, T >STL class
 Cstd::multiset< K >STL class
 Cstd::multiset< double >
 COsiIntegerBranchingObject
 COsiSOSBranchingObject
 Cstd::priority_queue< T >STL class
 Cstd::queue< T >STL class
 CReferencedObject
 Cstd::forward_list< T >::reverse_iteratorSTL iterator class
 Cstd::unordered_multimap< K, T >::reverse_iteratorSTL iterator class
 Cstd::string::reverse_iteratorSTL iterator class
 Cstd::vector< T >::reverse_iteratorSTL iterator class
 Cstd::set< K >::reverse_iteratorSTL iterator class
 Cstd::multiset< K >::reverse_iteratorSTL iterator class
 Cstd::unordered_map< K, T >::reverse_iteratorSTL iterator class
 Cstd::unordered_multiset< K >::reverse_iteratorSTL iterator class
 Cstd::basic_string< Char >::reverse_iteratorSTL iterator class
 Cstd::unordered_set< K >::reverse_iteratorSTL iterator class
 Cstd::map< K, T >::reverse_iteratorSTL iterator class
 Cstd::list< T >::reverse_iteratorSTL iterator class
 Cstd::multimap< K, T >::reverse_iteratorSTL iterator class
 Cstd::deque< T >::reverse_iteratorSTL iterator class
 Cstd::wstring::reverse_iteratorSTL iterator class
 Cstd::set< K >STL class
 Cstd::smart_ptr< T >STL class
 Cstd::stack< T >STL class
 Cstd::system_errorSTL class
 Cstd::threadSTL class
 Cstd::unique_ptr< T >STL class
 Cstd::unordered_map< K, T >STL class
 Cstd::unordered_multimap< K, T >STL class
 Cstd::unordered_multiset< K >STL class
 Cstd::unordered_set< K >STL class
 CUSER_initializeThis class is an abstract base class for the initializer class the user has to provide
 Cstd::valarray< T >STL class
 Cstd::vector< T >STL class
 Cstd::vector< int >
 Cstd::vector< OsiObject *>
 Cstd::weak_ptr< T >STL class
 CK
 CPar
 CT