{"id":"W1584124733","doi":"10.1613/jair.3713","title":"Generating Approximate Solutions to the TTP using a Linear Distance Relaxation","year":2012,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Canadian Mathematical Society","keywords":"Tournament; Linear programming relaxation; Combinatorics; Mathematics; Linear programming; Schedule; Scheduling (production processes); Mathematical optimization; Modulo; Relaxation (psychology); Computer science; Discrete mathematics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162398,0.001117611,0.0008147063,0.0004434906,0.0004426497,0.0009311536,0.001347828,0.001001886,0.005043064],"category_scores_gemma":[0.005434456,0.0004881223,0.001212065,0.0009203846,0.0006318763,0.001456069,0.001267524,0.001701672,0.0005816724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009944803,"about_ca_system_score_gemma":0.001142228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002466301,"about_ca_topic_score_gemma":0.002950175,"domain_scores_codex":[0.9991292,0.0003149741,0.00003624166,0.0002059961,0.0001654187,0.0001481866],"domain_scores_gemma":[0.9975497,0.001644876,0.0002468716,0.0003159877,0.0001441189,0.00009841888],"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.0002436174,0.0001770086,0.0008088305,0.0001992757,0.00004282391,0.0001463581,0.0001224423,0.9222564,0.003402204,0.01937754,0.004432506,0.04879097],"study_design_scores_gemma":[0.00006488798,0.0001018148,0.0001592175,0.00001206282,0.00001144676,0.00005926408,0.00006472383,0.9817119,0.001065967,0.01489423,0.001848258,0.00000619161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2187275,0.0004652318,0.7567546,0.0009425604,0.000101485,0.0002542607,0.000660627,0.001211866,0.0208819],"genre_scores_gemma":[0.4659975,0.000279672,0.5260551,0.0003160558,0.00007500696,0.00040672,0.001254814,0.000347701,0.005267362],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005043064,"threshold_uncertainty_score":0.01687074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.6328128500768635,"score_gpt":0.5480436522897456,"score_spread":0.08476919778711789,"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."}}