{"id":"W2134648168","doi":"10.1287/msom.1100.0302","title":"An Improved Dynamic Programming Decomposition Approach for Network Revenue Management","year":2010,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":60,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Dynamic programming; Decomposition; Revenue management; Bellman equation; Heuristic; Computer science; Revenue; Nonlinear programming; Nonlinear system; Function (biology); Mathematics; Economics","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008518297,0.0005107083,0.0003164593,0.0004538236,0.001214121,0.001580813,0.0009458827,0.0001198308,0.0001755955],"category_scores_gemma":[0.000004207044,0.0005328566,0.0001625101,0.000496107,0.00004134724,0.00167727,0.0004967251,0.0002876918,0.0001302177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000110375,"about_ca_system_score_gemma":0.000007753059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002913019,"about_ca_topic_score_gemma":0.001749254,"domain_scores_codex":[0.9971421,0.0000248158,0.0006011259,0.0009995713,0.0003769984,0.0008553951],"domain_scores_gemma":[0.9984682,0.00001411448,0.0001905106,0.00112201,0.0001431718,0.00006199096],"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.0004449788,0.003659089,0.0005813977,0.009948729,0.001521534,0.00006334726,0.0005218356,0.4051647,0.002314739,0.2274373,0.0140445,0.3342978],"study_design_scores_gemma":[0.00221728,0.00006069456,0.00536094,0.00009812209,0.0005933415,0.000003761365,0.001445294,0.616287,0.0002051502,0.00261426,0.3699272,0.00118696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3650339,0.0001418758,0.5227553,0.006726365,0.007616895,0.02569206,0.00006893773,0.002928467,0.06903622],"genre_scores_gemma":[0.7703435,0.00002320874,0.2126143,0.006964223,0.00191202,0.003429848,0.002044362,0.0001682397,0.002500245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4053097,"threshold_uncertainty_score":0.9997123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009026057899349026,"score_gpt":0.2433631331715402,"score_spread":0.2343370752721911,"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."}}