{"id":"W1853304843","doi":"10.1007/s10107-016-1079-2","title":"Tight MIP formulations for bounded up/down times and interval-dependent start-ups","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Interval (graph theory); Integer programming; Convex hull; Quadratic programming; Linear programming; Upper and lower bounds; Integer (computer science); Mathematical optimization; Combinatorics; Discrete mathematics; Regular polygon; 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.00639892,0.003924123,0.004359442,0.001785599,0.001178106,0.006036074,0.004891901,0.003862657,0.01528214],"category_scores_gemma":[0.02325253,0.002582714,0.00316568,0.00329218,0.001920602,0.006332164,0.003269422,0.00818796,0.001681716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003662223,"about_ca_system_score_gemma":0.003953516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004451157,"about_ca_topic_score_gemma":0.004331475,"domain_scores_codex":[0.9955658,0.001275773,0.0002354043,0.0007645809,0.001000306,0.001158015],"domain_scores_gemma":[0.9886951,0.008040808,0.0008952739,0.0007351818,0.0009715484,0.000662102],"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.0003125413,0.0002050858,0.0002779543,0.000628632,0.00009224997,0.0001407982,0.0001447728,0.8814324,0.001631248,0.08086865,0.007180277,0.02708538],"study_design_scores_gemma":[0.00003370184,0.00006488317,0.0001311478,0.00007346388,0.00004444317,0.00004306639,0.00005050702,0.9545563,0.0005045994,0.04321788,0.00126155,0.00001838342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01145445,0.001870413,0.970935,0.001077515,0.0002530098,0.0002112709,0.0007543019,0.0005491657,0.01289482],"genre_scores_gemma":[0.4884538,0.003415828,0.4857958,0.001151682,0.0008350555,0.001147722,0.001500882,0.001175461,0.01652378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01528214,"threshold_uncertainty_score":0.0511238,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03800690496063752,"score_gpt":0.2958300606662771,"score_spread":0.2578231557056396,"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."}}