{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001877304,0.002112741,0.001754626,0.002002805,0.001101782,0.001335387,0.001499509,0.002336644,0.0128373],"category_scores_gemma":[0.004316126,0.00102975,0.000959917,0.002409833,0.001104332,0.0015222,0.001218822,0.002870855,0.002078106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001318013,"about_ca_system_score_gemma":0.002381861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005114013,"about_ca_topic_score_gemma":0.005209225,"domain_scores_codex":[0.9991722,0.0003243891,0.00004460139,0.0001376483,0.0002081595,0.0001130355],"domain_scores_gemma":[0.9978725,0.001687269,0.00009206112,0.00006508965,0.0001955629,0.00008756238],"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.0002307689,0.0002121501,0.0004957322,0.00028129,0.00008194323,0.0002000121,0.0001257411,0.6995715,0.00193511,0.03835765,0.01213878,0.2463693],"study_design_scores_gemma":[0.0001093711,0.00008577242,0.0001100864,0.00002814335,0.00001537762,0.00005403335,0.00003208084,0.9670271,0.0005520377,0.02886507,0.00310825,0.00001267663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004216778,0.000338154,0.9914992,0.0002037836,0.00004755323,0.0001484858,0.000130192,0.0004310677,0.002984892],"genre_scores_gemma":[0.03902573,0.000284393,0.9569417,0.00009070168,0.000049429,0.0004912948,0.0004997504,0.0001794761,0.002437544],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0128373,"threshold_uncertainty_score":0.04294503,"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."}}