{"id":"W1760169573","doi":"","title":"A branch and cut algorithm for the optimal solution of the side-chain placement problem","year":2000,"lang":"en","type":"article","venue":"Max Planck Digital Library","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Waterloo","keywords":"Algorithm; Mathematics; Computer science; Branch and cut; Mathematical optimization; Integer programming","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000218023,0.00009658151,0.00008206521,0.00001538136,0.00006800667,0.00006911621,0.0000942657,0.00003724817,0.00001996931],"category_scores_gemma":[0.000004623836,0.00006227503,0.00003107923,0.00004818384,0.00004273716,0.0003393102,0.00003170445,0.00006526251,0.000002607866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007001871,"about_ca_system_score_gemma":0.000007567051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.08288e-7,"about_ca_topic_score_gemma":3.214341e-7,"domain_scores_codex":[0.9995613,0.000004194816,0.0001319026,0.00009555065,0.00006943612,0.0001376909],"domain_scores_gemma":[0.9997395,0.00009280245,0.00002317941,0.000117518,0.000004378783,0.0000226081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002779384,0.00001511344,0.00007803291,0.00005417998,0.00002452159,4.006422e-7,0.00007790004,0.8621814,0.00001185642,0.0003211405,0.002317503,0.1348901],"study_design_scores_gemma":[0.0008503969,0.00008889329,0.0009339599,0.00006755804,0.00002306501,0.00001429209,0.00004054464,0.9326894,0.003672293,0.005865262,0.05550048,0.0002538437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0163087,0.0009872838,0.9512175,0.0003599339,0.0002702211,0.001134662,0.001384014,0.0004205403,0.0279172],"genre_scores_gemma":[0.9745653,0.0001123446,0.02256061,0.00006137237,0.0001209283,0.00005609559,0.0001674494,0.00003993665,0.002315965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9582566,"threshold_uncertainty_score":0.2539502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005620490583041007,"score_gpt":0.1714027771102917,"score_spread":0.1657822865272507,"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."}}