{"id":"W2133331749","doi":"10.1088/1742-6596/256/1/012018","title":"Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University","funders":"","keywords":"Branch and bound; Integer programming; Computer science; Branch and cut; Parallel computing; Integer (computer science); Tree (set theory); Branch and price; Linear programming; Parallel algorithm; Algorithm; Upper and lower bounds; Shared memory; Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002918207,0.0001326749,0.0003029323,0.00006279655,0.0002252514,0.000631919,0.0003850308,0.00004916608,0.000007326944],"category_scores_gemma":[0.00002258642,0.0001196334,0.00003588539,0.0001398005,0.0001421524,0.001263101,0.0001896117,0.0002856396,8.966059e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006987551,"about_ca_system_score_gemma":0.000145652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002168472,"about_ca_topic_score_gemma":0.00001511942,"domain_scores_codex":[0.9990398,0.00005567992,0.0003890698,0.0001605252,0.0001929728,0.0001619702],"domain_scores_gemma":[0.9989403,0.00008051935,0.0003807309,0.0001734699,0.0003105173,0.0001144514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002023092,0.0001031285,0.01301255,0.00003427627,0.0001171623,0.000006221884,0.005065263,0.0001651215,0.008504388,0.1489888,0.001369394,0.8226134],"study_design_scores_gemma":[0.004498348,0.002608922,0.1106689,0.0002684362,0.0001973717,0.0005062711,0.001070032,0.05886628,0.183867,0.6245763,0.01109033,0.001781782],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09004052,0.00004879392,0.9087112,0.0007694024,0.0001767416,0.00008358141,0.000006939004,0.00004006075,0.0001227724],"genre_scores_gemma":[0.6546624,0.00007900358,0.3450155,0.00004112196,0.0001652061,0.000001880501,0.000002707367,0.000004906698,0.00002723114],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8208317,"threshold_uncertainty_score":0.609361,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03490018657931901,"score_gpt":0.3187391859240121,"score_spread":0.283838999344693,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}