{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140085,0.0007455422,0.0008622047,0.001075203,0.0007307164,0.001817256,0.002505256,0.000641392,0.008259633],"category_scores_gemma":[0.005385367,0.0004549871,0.0003822394,0.002803207,0.0004762441,0.001895168,0.00113848,0.0009810489,0.002313488],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007876723,"about_ca_system_score_gemma":0.001702235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005137144,"about_ca_topic_score_gemma":0.005028982,"domain_scores_codex":[0.998447,0.0003215534,0.00009609434,0.0001238924,0.0008618751,0.0001496648],"domain_scores_gemma":[0.9975635,0.0007964364,0.0001527335,0.0005775527,0.0008055476,0.0001042493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002317718,0.0005611778,0.003662623,0.0005107293,0.0001581651,0.0002147206,0.0002080747,0.1831248,0.00629306,0.03890731,0.02333657,0.7407051],"study_design_scores_gemma":[0.0004882644,0.0004428855,0.002585632,0.0001045106,0.0001388549,0.0003557464,0.0002101553,0.8803663,0.0169142,0.02441637,0.07391388,0.00006319903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07157147,0.00303239,0.8281838,0.0007679656,0.000452747,0.0004546231,0.0007361874,0.02108263,0.07371804],"genre_scores_gemma":[0.2075608,0.002060756,0.7672039,0.0002553537,0.0001241887,0.0005332601,0.001637311,0.002469415,0.01815494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008259633,"threshold_uncertainty_score":0.02763122,"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."}}