{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002353491,0.001015165,0.001433397,0.0009245186,0.0008500261,0.001754878,0.001559451,0.001013657,0.003651099],"category_scores_gemma":[0.004848335,0.0009834606,0.001023114,0.002114562,0.0006306881,0.002647098,0.001906654,0.001548033,0.0002855329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009562693,"about_ca_system_score_gemma":0.001006868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002742024,"about_ca_topic_score_gemma":0.003796608,"domain_scores_codex":[0.9989284,0.0005170565,0.00004531669,0.0001470231,0.0002566249,0.0001055225],"domain_scores_gemma":[0.9980978,0.001295831,0.0001686364,0.0001669425,0.000208662,0.00006208071],"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.00007080337,0.00006268394,0.0002117478,0.0001135815,0.00004802121,0.00006066151,0.00006472829,0.9211106,0.001286057,0.03794512,0.0017306,0.03729537],"study_design_scores_gemma":[0.000009072844,0.00001859879,0.00005459558,0.000007955251,0.000007267058,0.00001393936,0.00001219992,0.9862293,0.0003799412,0.01254779,0.0007150859,0.00000432094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008578612,0.0001738776,0.9885937,0.0001373961,0.00003476782,0.00005671322,0.0000623,0.00005337946,0.002309318],"genre_scores_gemma":[0.3751153,0.000468847,0.6179766,0.0001721938,0.0001082985,0.0004404704,0.0004176892,0.0001681097,0.005132487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003651099,"threshold_uncertainty_score":0.01244658,"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."}}