{"id":"W2140541505","doi":"10.1287/opre.2013.1247","title":"Integral Simplex Using Decomposition for the Set Partitioning Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Simplex; Sequence (biology); Simplex algorithm; Mathematics; Polytope; Constructive; Mathematical optimization; Degeneracy (biology); Integer (computer science); Set (abstract data type); Revised simplex method; Decomposition; Combinatorics; Variable (mathematics); Integer programming; Algorithm; Linear programming; 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.0009977729,0.0009865481,0.001081879,0.001125292,0.0006112948,0.001407998,0.001158271,0.0008343612,0.005306846],"category_scores_gemma":[0.003106903,0.0004838442,0.001108261,0.001934227,0.0009668345,0.001634651,0.001702448,0.002639352,0.001286244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009621786,"about_ca_system_score_gemma":0.001189473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001857315,"about_ca_topic_score_gemma":0.001974197,"domain_scores_codex":[0.9990113,0.0003203586,0.00003672305,0.0001097743,0.0004067986,0.0001150481],"domain_scores_gemma":[0.9992749,0.0004172712,0.0000542724,0.00009424175,0.0001066156,0.00005264462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000155198,0.0001646616,0.0004695687,0.0003230713,0.00005962965,0.0001328793,0.0001975544,0.5183463,0.006098879,0.2997125,0.005973475,0.1683663],"study_design_scores_gemma":[0.00002653939,0.00005271087,0.0001131365,0.00003330332,0.00001692693,0.0001039802,0.00003561137,0.8835615,0.002034205,0.1065414,0.007466191,0.00001451152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0103015,0.0003553902,0.978434,0.0001375762,0.00004187702,0.00009055413,0.00009379635,0.0001618708,0.0103834],"genre_scores_gemma":[0.1356008,0.0009026351,0.8575357,0.00009635354,0.00006640527,0.0003746608,0.0004193618,0.0002147464,0.004789365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005306846,"threshold_uncertainty_score":0.01775312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1774074885190413,"score_gpt":0.4851467205756244,"score_spread":0.307739232056583,"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."}}