{"id":"W2049188596","doi":"10.1016/j.cor.2012.11.017","title":"Efficient symmetry breaking formulations for the job grouping problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Solver; Set (abstract data type); Reduction (mathematics); Computer science; Symmetry breaking; Mathematical optimization; Relaxation (psychology); Variable (mathematics); Order (exchange); Upper and lower bounds; Symmetry (geometry); Mathematics; Algorithm; Combinatorics","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.0009983386,0.00009539459,0.00008521791,0.0002154237,0.001057406,0.0002644337,0.000236279,0.00005305075,0.00001793564],"category_scores_gemma":[0.00007896328,0.00007575136,0.00005261123,0.0006284334,0.00004885209,0.000131823,0.00006978578,0.0002494088,0.00004080599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001130975,"about_ca_system_score_gemma":0.00003216652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002103816,"about_ca_topic_score_gemma":0.00001045219,"domain_scores_codex":[0.9988836,0.00005378867,0.0001984942,0.0001262331,0.0002710173,0.0004668491],"domain_scores_gemma":[0.9988447,0.0005369244,0.000006506895,0.0002526118,0.0002609389,0.00009827741],"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.0000011757,0.00002172809,0.00008010031,0.00001789843,0.00002547083,8.442013e-8,0.0008351979,0.9744177,0.00008068618,0.01185924,0.000631762,0.01202899],"study_design_scores_gemma":[0.0001846108,0.00001530826,0.000534407,0.00002629366,0.000007036023,0.00000459753,0.0001964819,0.9973843,0.0001414416,0.00002729381,0.001381648,0.00009663101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01933503,0.0006421097,0.9774075,0.0004731202,0.0005697248,0.0006811502,0.000006667187,0.000186757,0.0006979205],"genre_scores_gemma":[0.7287794,0.00001390932,0.2704199,0.00003184664,0.0004108884,0.0002014845,0.00001905672,0.00002680497,0.00009665846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7094444,"threshold_uncertainty_score":0.8132819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05907970323379737,"score_gpt":0.3424149566715785,"score_spread":0.2833352534377811,"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."}}