{"id":"W2778922089","doi":"10.1287/opre.2019.1953","title":"Network-Based Approximate Linear Programming for Discrete Optimization","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Linear programming; Solver; Graph; Simple (philosophy); Discrete optimization; Stochastic programming; Optimization problem; Theoretical computer science; Algorithm; Mathematics","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.001773619,0.001596859,0.001390812,0.0008698074,0.0005603984,0.001748119,0.001350213,0.001335555,0.006063951],"category_scores_gemma":[0.008087454,0.0007701937,0.0009658548,0.001988313,0.001346752,0.001977416,0.001558083,0.003269663,0.0007825225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002857117,"about_ca_system_score_gemma":0.001909779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01198926,"about_ca_topic_score_gemma":0.01305815,"domain_scores_codex":[0.9989452,0.000459385,0.00003770236,0.0001650036,0.0002917515,0.0001009038],"domain_scores_gemma":[0.9954754,0.003878657,0.0001886719,0.0001458571,0.0002391432,0.00007238431],"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.00001741806,0.00002276628,0.0001374628,0.00005956832,0.00001479174,0.00001690754,0.00002109922,0.9513547,0.00009481572,0.03823576,0.001062047,0.008962712],"study_design_scores_gemma":[0.000002330331,0.000002420214,0.00001006493,0.00000372935,0.000001241351,0.000001920193,0.000003184578,0.9856515,0.00003375679,0.01397368,0.0003152337,0.000001003281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002922899,0.0004074924,0.9915496,0.0004111297,0.00004284911,0.00003895106,0.0001223037,0.0001911754,0.004313451],"genre_scores_gemma":[0.4422142,0.001648282,0.54093,0.000485862,0.0001956122,0.0008336455,0.0009056664,0.0004829956,0.01230359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01198926,"threshold_uncertainty_score":0.02383894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1355869619349261,"score_gpt":0.3450257601634374,"score_spread":0.2094387982285113,"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."}}