{"id":"W2057459863","doi":"10.1007/s10107-008-0254-5","title":"Multi-phase dynamic constraint aggregation for set partitioning type problems","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Constraint (computer-aided design); Disjoint sets; Computation; Relaxation (psychology); Set (abstract data type); Computer science; Mathematics; Local consistency; Scheduling (production processes); Algorithm; Constraint satisfaction problem; Probabilistic logic","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004198052,0.0001527086,0.0002067618,0.00006139293,0.0001717538,0.00005153574,0.00008374156,0.00009123457,0.0000468355],"category_scores_gemma":[0.000458814,0.0001538602,0.00006494767,0.0002153738,0.00008929833,0.0001134865,0.00001610004,0.000127441,0.00003889615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006710739,"about_ca_system_score_gemma":0.0000184967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.557235e-7,"about_ca_topic_score_gemma":9.783391e-7,"domain_scores_codex":[0.9989583,0.00003253727,0.0003800118,0.0001720669,0.0001330542,0.0003239997],"domain_scores_gemma":[0.9994086,0.0001872618,0.00005602924,0.0001599303,0.00009455295,0.00009360432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005043673,0.001183999,0.0004248156,0.004568772,0.0003337069,0.00004468283,0.01211763,0.4520324,0.01479087,0.0112702,0.0003212001,0.5028613],"study_design_scores_gemma":[0.0008281136,0.00006719124,0.0000104173,0.0001213597,0.00002171444,0.00005211833,0.0001013309,0.9958166,0.0007063675,0.001371148,0.0007129631,0.0001906999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04529796,0.00007061542,0.9528617,0.00003700899,0.00009522898,0.0007540706,0.000005852877,0.0007221323,0.0001554753],"genre_scores_gemma":[0.37877,0.000005226801,0.6209518,0.000008289862,0.00002056988,0.000124861,0.00003006415,0.00003748826,0.0000517847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5437841,"threshold_uncertainty_score":0.6274236,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06582903588106113,"score_gpt":0.3370300050388169,"score_spread":0.2712009691577557,"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."}}