{"id":"W2788438366","doi":"10.1609/aaai.v32i1.12082","title":"Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Integer programming; Linear programming; Mathematical optimization; Linear programming relaxation; Computer science; Heuristic; Branch and price; State (computer science); State variable; Relaxation (psychology); Mathematics; Algorithm","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.0006650915,0.0002447366,0.0002579259,0.0001261943,0.0003945713,0.0003044135,0.001169911,0.0001055871,0.00001270526],"category_scores_gemma":[0.0006517829,0.0001900077,0.00008378375,0.000464939,0.0004383784,0.0002349851,0.0002148362,0.0002784092,0.00002000387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000272722,"about_ca_system_score_gemma":0.0001367259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000174784,"about_ca_topic_score_gemma":0.000001829888,"domain_scores_codex":[0.9982598,0.00001565553,0.000451277,0.0005194808,0.0003099167,0.0004439015],"domain_scores_gemma":[0.9981401,0.0002768349,0.0003612841,0.000238319,0.0008670809,0.0001163966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006075386,0.0003432975,0.003302063,0.0003568176,0.00006115899,0.000002292772,0.007269165,0.001985913,0.009667315,0.5843688,0.001446559,0.3905891],"study_design_scores_gemma":[0.00006296512,0.0008960976,0.00005747722,0.0004799003,0.00001948664,0.000005123249,0.0002982469,0.8205997,0.159985,0.01519735,0.002100763,0.0002978972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03644428,0.00004129327,0.9589416,0.002182893,0.0004389692,0.0007731023,0.000009552135,0.0001624644,0.001005817],"genre_scores_gemma":[0.9049265,0.000002583691,0.0944624,0.0002934413,0.0001453011,0.00006301692,0.000001336353,0.00001602165,0.0000893769],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8684822,"threshold_uncertainty_score":0.774829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09279822587069986,"score_gpt":0.328170930781379,"score_spread":0.2353727049106792,"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."}}