{"id":"W2966130377","doi":"10.1287/ijoc.2020.1039","title":"Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems","year":2021,"lang":"en","type":"preprint","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Vertex (graph theory); Discretization; Integer programming; Constraint programming; Combinatorics; Mathematical optimization; Discrete mathematics; Graph","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.001922748,0.001615895,0.001033854,0.000957646,0.0004701156,0.002246559,0.001678316,0.001249567,0.004496207],"category_scores_gemma":[0.003589886,0.0006322492,0.001330195,0.002281469,0.00133529,0.002089903,0.00176309,0.003859411,0.0005785289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001695202,"about_ca_system_score_gemma":0.001581612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003436808,"about_ca_topic_score_gemma":0.003459307,"domain_scores_codex":[0.998894,0.0005219847,0.00004849776,0.0001732335,0.0002434957,0.0001187739],"domain_scores_gemma":[0.998109,0.001353674,0.0001859642,0.0001273458,0.0001333812,0.0000905893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004402645,0.00009154074,0.0002899774,0.0001765299,0.00004530355,0.00006295633,0.00006331041,0.8447918,0.0005682055,0.1193394,0.002246464,0.03228053],"study_design_scores_gemma":[0.00001364914,0.00002178459,0.00005112127,0.00002137508,0.000008193815,0.00001997045,0.0000231973,0.9504409,0.0002748026,0.04716519,0.001952986,0.000006842344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005780597,0.0005949672,0.9873338,0.000489342,0.00005289989,0.00004790167,0.0001426608,0.00009682423,0.005461012],"genre_scores_gemma":[0.1844102,0.001651667,0.8079281,0.0004141413,0.0002106196,0.0004344089,0.0004438759,0.000168767,0.004338071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004496207,"threshold_uncertainty_score":0.01504135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04288099152760674,"score_gpt":0.2772684581902206,"score_spread":0.2343874666626138,"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."}}