{"id":"W1972237262","doi":"10.1007/s10601-012-9136-9","title":"Using dual presolving reductions to reformulate cumulative constraints","year":2013,"lang":"en","type":"article","venue":"Constraints","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Solver; Computer science; Constraint programming; Dual (grammatical number); Benchmark (surveying); Integer programming; Scheduling (production processes); Variable (mathematics); Linear programming; Domain (mathematical analysis); Constraint (computer-aided design); State variable; Computational complexity theory; Mathematics; Algorithm; Stochastic programming","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.001442198,0.001255434,0.0008888296,0.001527105,0.0009008757,0.002217495,0.001941933,0.0007599359,0.00973809],"category_scores_gemma":[0.006885007,0.0007610981,0.001734855,0.001744326,0.001548462,0.003122719,0.002627473,0.005671014,0.001353748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001382472,"about_ca_system_score_gemma":0.001537223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00362393,"about_ca_topic_score_gemma":0.006562791,"domain_scores_codex":[0.9989148,0.0003412597,0.00005236372,0.000183638,0.0003817137,0.0001261601],"domain_scores_gemma":[0.99821,0.000997557,0.0000953821,0.0002937244,0.0003340937,0.0000692139],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005405955,0.00010504,0.0002138182,0.0001665494,0.00004306527,0.0001259985,0.000150752,0.1145614,0.001887841,0.7965779,0.008062835,0.07805069],"study_design_scores_gemma":[0.00002351882,0.00002367174,0.00008350863,0.00005369309,0.00003074379,0.0000584664,0.00005258181,0.3819958,0.002324976,0.602511,0.01281803,0.00002403251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005118775,0.0001578699,0.9818133,0.0002434343,0.0001239902,0.00004016727,0.0001010539,0.0001616747,0.01223983],"genre_scores_gemma":[0.227293,0.0005940901,0.7452204,0.0004456277,0.0003168701,0.0002766991,0.0007918112,0.0007322833,0.02432932],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00973809,"threshold_uncertainty_score":0.03257716,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04453748127260258,"score_gpt":0.2950699864660795,"score_spread":0.2505325051934769,"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."}}