{"id":"W2573661439","doi":"","title":"Stabilized Dynamic Constraint Aggregation for Solving Set Partitioning Problems","year":2011,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Degeneracy (biology); Mathematical optimization; Constraint (computer-aided design); Computer science; Scheduling (production processes); Set (abstract data type); Column generation; Dual (grammatical number); Constraint satisfaction problem; Variable (mathematics); Space (punctuation); Projection (relational algebra); Mathematics; Algorithm; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001070083,0.0003011563,0.0003167206,0.0002809939,0.000227847,0.0001118587,0.0002513456,0.0002466248,0.0001000211],"category_scores_gemma":[0.0003431756,0.0003458853,0.0001414785,0.0003664021,0.00008063085,0.0003661262,0.00005181925,0.0002796146,0.000007346263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003727551,"about_ca_system_score_gemma":0.00008488594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000343243,"about_ca_topic_score_gemma":0.0005132416,"domain_scores_codex":[0.9981639,0.00008420751,0.000576441,0.0003341254,0.0001863099,0.0006550003],"domain_scores_gemma":[0.9988594,0.0001720234,0.0001561695,0.0004668774,0.0001549824,0.0001905183],"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.0001068864,0.0001920605,0.01939084,0.0006120055,0.0002277451,0.00001552744,0.005270216,0.8168607,0.06134154,0.02216505,0.0008454283,0.07297198],"study_design_scores_gemma":[0.0005889897,0.00006682653,0.002596781,0.0001100904,0.00003688788,0.00003212036,0.0002145557,0.9705077,0.02147448,0.003772887,0.0002062421,0.0003924456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06298457,0.0003495,0.9322711,0.000141146,0.0001693889,0.001170777,0.00006179463,0.002142357,0.000709315],"genre_scores_gemma":[0.5536211,0.00005494897,0.4453388,0.00009159005,0.00002843125,0.0006847067,0.00004656299,0.00008014401,0.00005370025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4906365,"threshold_uncertainty_score":0.9998993,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02307070819783844,"score_gpt":0.247880371605375,"score_spread":0.2248096634075366,"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."}}