{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001311375,0.001113794,0.001395219,0.001306365,0.001045508,0.001315045,0.001490474,0.001490236,0.01162217],"category_scores_gemma":[0.003538401,0.0007109596,0.00116483,0.002353046,0.0006575728,0.00129742,0.001443535,0.003340172,0.001569358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342095,"about_ca_system_score_gemma":0.002666276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003737557,"about_ca_topic_score_gemma":0.004476558,"domain_scores_codex":[0.9991016,0.0002890317,0.00003934918,0.0001493765,0.0002922584,0.0001284284],"domain_scores_gemma":[0.9988074,0.0007426042,0.0000872038,0.0001045947,0.0001804225,0.00007786185],"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.0001262037,0.0003016335,0.0003945124,0.0002058042,0.00006648115,0.0002033679,0.00008508869,0.6646436,0.00490155,0.06387657,0.01327706,0.2519182],"study_design_scores_gemma":[0.00005161832,0.0000686713,0.0001099692,0.00001530019,0.00001477704,0.00006703149,0.00002344248,0.9525108,0.001549016,0.04178469,0.003790144,0.00001450729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002455118,0.00005711723,0.9946833,0.0001364866,0.00003288972,0.0001520834,0.0001273704,0.0003015862,0.002054067],"genre_scores_gemma":[0.05170423,0.000136113,0.944739,0.00009776896,0.00004688774,0.0004593748,0.0004827014,0.0002012585,0.002132665],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01162217,"threshold_uncertainty_score":0.03887999,"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."}}