{"id":"W2937321088","doi":"10.1287/ijoc.2019.0915","title":"A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem","year":2020,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Belgian Federal Science Policy Office","keywords":"Mathematics; Sorting; Column generation; Mathematical optimization; Branch and cut; Relaxation (psychology); Linear programming relaxation; Set (abstract data type); Position (finance); Variable (mathematics); Exponential function; Integer programming; Algorithm; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006107338,0.000171725,0.0001955449,0.00005656145,0.0003573903,0.0002466297,0.000240947,0.00006817021,0.00001067219],"category_scores_gemma":[0.0004222537,0.0001112459,0.0000784237,0.000258726,0.00002605245,0.0002011838,0.00005067623,0.0005101309,0.000006405714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003972368,"about_ca_system_score_gemma":0.00004527784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.42003e-7,"about_ca_topic_score_gemma":7.81586e-7,"domain_scores_codex":[0.998899,0.00001861949,0.0004378785,0.0001118902,0.0002105925,0.0003219818],"domain_scores_gemma":[0.9990751,0.0004047522,0.0001484984,0.00009060081,0.00009292093,0.0001881828],"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.00002506605,0.000002918478,0.0003570848,0.0001406403,0.00007367248,0.000002164943,0.002900476,0.87967,0.0001251964,0.0003012795,0.0008257892,0.1155757],"study_design_scores_gemma":[0.0006683656,0.00009357396,0.0003852105,0.0001133973,0.00001715686,0.00008651939,0.0001551047,0.9908656,0.0003001929,0.0003557347,0.006786772,0.0001723165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01951893,0.000176778,0.9727954,0.005304377,0.0003146869,0.0004417496,0.000003565098,0.0002699293,0.001174598],"genre_scores_gemma":[0.8650287,0.00005908046,0.1325555,0.001494945,0.000781497,0.000006879952,0.000002307223,0.00005339906,0.00001760018],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8455098,"threshold_uncertainty_score":0.4536478,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0203757860520663,"score_gpt":0.265880337222943,"score_spread":0.2455045511708767,"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."}}