{"id":"W2567598518","doi":"10.1016/j.cor.2019.05.008","title":"An RLT approach for solving the binary-constrained mixed linear complementarity problem","year":2019,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mixed complementarity problem; Complementarity theory; Linear complementarity problem; Complementarity (molecular biology); Linear programming; Mathematical optimization; Binary number; Mathematics; Generalized linear mixed model; Applied mathematics; Computer science; Nonlinear system","routes":{"ca_aff":true,"ca_fund":true,"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.001772999,0.001382027,0.001133028,0.001031578,0.0006480786,0.001290106,0.001660524,0.00139885,0.01221726],"category_scores_gemma":[0.003907079,0.0006685284,0.001520989,0.001324135,0.001315477,0.001441686,0.001962733,0.002718544,0.001867585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008568648,"about_ca_system_score_gemma":0.001602862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004017984,"about_ca_topic_score_gemma":0.003706114,"domain_scores_codex":[0.9987815,0.0004868305,0.00005201904,0.000171359,0.0004226167,0.00008572343],"domain_scores_gemma":[0.9990663,0.0005678028,0.00009136228,0.00006850887,0.000173791,0.00003229935],"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.00003508673,0.00007503371,0.000157168,0.0003256628,0.00005462724,0.0001621888,0.0000950305,0.7518917,0.002773111,0.1765023,0.004317063,0.0636111],"study_design_scores_gemma":[0.00001444564,0.00002539947,0.00002295877,0.00001876456,0.000007710581,0.00003724242,0.00001205667,0.9686999,0.0004736148,0.02700117,0.003677922,0.000008868538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004482539,0.00007217849,0.9948909,0.0001104514,0.00003299515,0.00004050067,0.00001886203,0.00007061098,0.004315128],"genre_scores_gemma":[0.07743166,0.00032011,0.9124141,0.0004347676,0.0001218025,0.0005763464,0.0001451005,0.0001976021,0.008358511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01221726,"threshold_uncertainty_score":0.04087079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08351850770169487,"score_gpt":0.3778910483446238,"score_spread":0.2943725406429289,"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."}}