Correct four approved decision-horizon category values

Only category values for ji2019, kress2019, salemi2022 and wangk2020 change in the two existing metadata files. Preserve HF-current application fields and all other data; no reports, figures or new fields.

metadata/paper_meta_info.json

@@ -40,7 +40,7 @@
     "year": 2020,
     "direction": "min",
     "problem_class": "Scheduling",
-    "category": "operational",
+    "category": "strategic",
     "formulation_type": "MILP",
     "application_field": "Aerospace & Aviation",
     "avg_num_var": 2270298.0,
@@ -2727,7 +2727,7 @@
     "year": 2019,
     "direction": "min",
     "problem_class": "Scheduling",
-    "category": "strategic",
+    "category": "operational",
     "formulation_type": "MIQP",
     "application_field": "Transportation & Logistics",
     "avg_num_var": 3738.0,
@@ -3009,7 +3009,7 @@
     "year": 2019,
     "direction": "min",
     "problem_class": "Scheduling",
-    "category": "strategic",
+    "category": "operational",
     "formulation_type": "MILP",
     "application_field": "Transportation & Logistics",
     "avg_num_var": 47600.0,
@@ -4529,7 +4529,7 @@
     "year": 2022,
     "direction": "min",
     "problem_class": "Scheduling",
-    "category": "strategic",
+    "category": "operational",
     "formulation_type": "MILP",
     "application_field": "Energy & Power Systems",
     "avg_num_var": 489600.0,

metadata/paper_meta_info_180.csv

@@ -1,6 +1,6 @@
 paper_id,paper_title,publication,year,direction,problem_class,category,formulation_type,application_field,avg_num_var,avg_num_int_var,avg_num_constr,source_link,problem_subclass,problem_class_primary,problem_class_structural_labels,problem_class_compound_labels,problem_class_components,formulation_objective,formulation_uncertainty,formulation_special_constraints,formulation_constraints,formulation_family,formulation_variables,formulation_hierarchy
 adulyasak2015,Benders Decomposition for Production Routing Under Demand Uncertainty,Operations Research,2015,min,Routing,operational,MILP,Supply Chain & Inventory,920934.0,8934.0,953310.0,https://doi.org/10.1287/opre.2015.1401,Capacitated VRP,Routing,"[""Routing::Capacitated VRP"", ""Inventory & Lot Sizing::Production-Inventory Planning""]","[""Inventory & Lot Sizing::Production-Inventory Planning""]",[],linear,stochastic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
-wangk2020,A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations,Operations Research,2020,min,Scheduling,operational,MILP,Aerospace & Aviation,2270298.0,1861248.0,6929616.0,https://doi.org/10.1287/opre.2020.1985,Event Scheduling,Scheduling,"[""Scheduling::Event Scheduling""]",[],[],linear,stochastic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
+wangk2020,A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations,Operations Research,2020,min,Scheduling,strategic,MILP,Aerospace & Aviation,2270298.0,1861248.0,6929616.0,https://doi.org/10.1287/opre.2020.1985,Event Scheduling,Scheduling,"[""Scheduling::Event Scheduling""]",[],[],linear,stochastic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 wangy2020,The Rank-One Quadratic Assignment Problem,INFORMS Journal on Computing,2020,min,Assignment & Matching,planning,BQP,Foundational / Theoretical,4000035.0,4000017.0,4070.0,https://pubsonline.informs.org/doi/10.1287/ijoc.2020.1003,Quadratic Assignment,Assignment & Matching,"[""Assignment & Matching::Quadratic Assignment""]",[],[],quadratic,deterministic,"[""none""]",linear,Quadratic,binary,single_level
 alba2013,A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks,INFORMS Journal on Computing,2013,min,Routing,operational,BIP,Transportation & Logistics,840.0,840.0,544.0,https://doi.org/10.1287/ijoc.1110.0489,Pickup-and-Delivery Problem,Routing,"[""Routing::Pickup-and-Delivery Problem"", ""Packing, Cutting & Loading::LIFO Stack Loading""]","[""Packing, Cutting & Loading::LIFO Stack Loading""]",[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 alfieri2020,Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring,Proceedings of the AAAI Conference on Artificial Intelligence,2022,min,Graph Optimization,operational,BIP,Foundational / Theoretical,36018.0,36018.0,721747.0,https://doi.org/10.1609/aaai.v36i9.21230,Graph Coloring,Graph Optimization,"[""Graph Optimization::Graph Coloring""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
@@ -85,7 +85,7 @@ hewitt2024,Production planning under demand and endogenous supply uncertainty,ar
 hoffman1993,Solving Airline Crew Scheduling Problems by Branch-and-Cut,Management Science,1993,min,Scheduling,strategic,BIP,Aerospace & Aviation,15000.0,15000.0,100.0,https://doi.org/10.1287/mnsc.39.6.657,Crew Scheduling,Scheduling,"[""Scheduling::Crew Scheduling""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 hosseinian2020,A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem,INFORMS Journal on Computing,2020,max,Graph Optimization,planning,BIP,Foundational / Theoretical,40300.0,40300.0,119700.0,https://pubsonline.informs.org/doi/10.1287/ijoc.2019.0898,Maximum Clique,Graph Optimization,"[""Graph Optimization::Maximum Clique""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 huisman2005,Multiple-Depot Integrated Vehicle and Crew Scheduling,Transportation Science,2005,min,Scheduling,operational,BIP,Public Transit & Mobility,287214.0,287214.0,1512.0,https://doi.org/10.1287/trsc.1040.0104,Integrated Vehicle and Crew Scheduling,Scheduling,"[""Scheduling::Integrated Vehicle and Crew Scheduling""]",[],"[{""family"": ""Scheduling"", ""subtype"": ""Vehicle Scheduling""}, {""family"": ""Scheduling"", ""subtype"": ""Crew Scheduling""}]",linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
-ji2019,Exact and heuristic methods for optimizing lock-quay system in inland waterway,European Journal of Operational Research,2019,min,Scheduling,strategic,MIQP,Transportation & Logistics,3738.0,2274.0,7261.0,https://doi.org/10.1016/j.ejor.2019.03.010,Batch Scheduling,Scheduling,"[""Scheduling::Batch Scheduling"", ""Packing, Cutting & Loading::Two-Dimensional Packing""]","[""Packing, Cutting & Loading::Two-Dimensional Packing""]",[],quadratic,deterministic,"[""none""]",linear,Quadratic,mixed_continuous_discrete,single_level
+ji2019,Exact and heuristic methods for optimizing lock-quay system in inland waterway,European Journal of Operational Research,2019,min,Scheduling,operational,MIQP,Transportation & Logistics,3738.0,2274.0,7261.0,https://doi.org/10.1016/j.ejor.2019.03.010,Batch Scheduling,Scheduling,"[""Scheduling::Batch Scheduling"", ""Packing, Cutting & Loading::Two-Dimensional Packing""]","[""Packing, Cutting & Loading::Two-Dimensional Packing""]",[],quadratic,deterministic,"[""none""]",linear,Quadratic,mixed_continuous_discrete,single_level
 juvin2023,Logic-based Benders decomposition for the preemptive Flexible Job-Shop Scheduling Problem,Computers & Operations Research,2023,min,Scheduling,operational,MIQCQP,Manufacturing & Production,39828.0,39827.0,111343.0,https://doi.org/10.1016/j.cor.2023.106156,Job-Shop Scheduling,Scheduling,"[""Scheduling::Job-Shop Scheduling""]",[],[],linear,deterministic,"[""none""]",quadratic,Quadratic,mixed_continuous_discrete,single_level
 kang2021,An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem,Transportation Science,2021,min,Routing,operational,MILP,Transportation & Logistics,7654.0,7551.0,2809.0,https://doi.org/10.1287/trsc.2021.1055,VRP,Routing,"[""Routing::VRP""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 klose2005,Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation,Management Science,2005,min,Facility Location,planning,MILP,Transportation & Logistics,1125750.0,750.0,1127251.0,https://doi.org/10.1287/mnsc.1050.0410,Capacitated Facility Location,Facility Location,"[""Facility Location::Capacitated Facility Location""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
@@ -94,7 +94,7 @@ kobayashi2021,Bilevel Cutting-plane Algorithm for Solving Cardinality-constraine
 kobeaga2024,A revisited branch-and-cut algorithm for large-scale orienteering problems,European Journal of Operational Research,2024,max,Routing,operational,MILP,Foundational / Theoretical,45150.0,45150.0,90002.0,https://www.sciencedirect.com/science/article/pii/S0377221723005933,Orienteering Problem,Routing,"[""Routing::Orienteering Problem""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 kowalczyk2018,A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching,INFORMS Journal on Computing,2018,min,Scheduling,strategic,BIP,Manufacturing & Production,284784.0,284784.0,31.0,https://doi.org/10.1287/ijoc.2018.0809,Parallel-Machine Scheduling,Scheduling,"[""Scheduling::Parallel-Machine Scheduling""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 kowalczyk2024,A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams,INFORMS Journal on Computing,2024,min,Scheduling,strategic,BIP,Manufacturing & Production,130970.0,65485.0,65536.0,https://doi.org/10.1287/ijoc.2022.0301,Parallel-Machine Scheduling,Scheduling,"[""Scheduling::Parallel-Machine Scheduling""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
-kress2019,An Exact Solution Approach for Scheduling Cooperative Gantry Cranes,European Journal of Operational Research,2019,min,Scheduling,strategic,MILP,Transportation & Logistics,47600.0,47029.0,65965.0,https://doi.org/10.1016/j.ejor.2018.07.045,Crane Scheduling,Scheduling,"[""Scheduling::Crane Scheduling""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
+kress2019,An Exact Solution Approach for Scheduling Cooperative Gantry Cranes,European Journal of Operational Research,2019,min,Scheduling,operational,MILP,Transportation & Logistics,47600.0,47029.0,65965.0,https://doi.org/10.1016/j.ejor.2018.07.045,Crane Scheduling,Scheduling,"[""Scheduling::Crane Scheduling""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 kreter2018,Mixed-Integer Linear Programming and Constraint Programming Formulations for Solving Resource Availability Cost Problems,European Journal of Operational Research,2018,min,Scheduling,planning,Combinatorial (non-algebraic),Manufacturing & Production,52059.0,52055.0,110513.0,https://doi.org/10.1016/j.ejor.2017.10.014,Project Scheduling,Scheduling,"[""Scheduling::Project Scheduling""]",[],[],linear,deterministic,"[""nonlinear_logical""]",non_algebraic,Combinatorial,mixed_continuous_discrete,single_level
 laporte2003,A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem,Operations Research,2003,min,Routing,operational,MILP,Transportation & Logistics,10091.0,5050.0,5440.0,https://doi.org/10.1287/opre.51.6.940.24921,Traveling Purchaser Problem,Routing,"[""Routing::Traveling Purchaser Problem"", ""Resource Allocation & Blending::Resource Allocation""]","[""Resource Allocation & Blending::Resource Allocation""]",[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 lee1996,A Branch and Cut Algorithm for a Steiner Tree-Star Problem,INFORMS Journal on Computing,1996,min,Network Design,planning,MILP,Telecommunications & Networking,12985.0,70.0,15621.0,https://doi.org/10.1287/ijoc.8.3.194,Steiner Tree,Network Design,"[""Network Design::Steiner Tree""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
@@ -142,7 +142,7 @@ rothenbacher2018,Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Prob
 rothenbacher2019,Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures,Transportation Science,2019,min,Routing,operational,BIP,Supply Chain & Inventory,64115.0,64115.0,214.0,https://doi.org/10.1287/trsc.2018.0855,VRP with Time Windows,Routing,"[""Routing::VRP with Time Windows""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 ruiz2007,An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem,Omega,2014,min,Scheduling,operational,MILP,Manufacturing & Production,9167.0,7921.0,2656.0,https://doi.org/10.1016/j.omega.2013.10.002,Flow-Shop Scheduling,Scheduling,"[""Scheduling::Flow-Shop Scheduling""]",[],[],linear,deterministic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 sadykov2013,Bin Packing with Conflicts: a Generic Branch-and-Price Algorithm,INFORMS Journal on Computing,2013,min,"Packing, Cutting & Loading",planning,BIP,Foundational / Theoretical,12210.0,12210.0,461889.0,https://pubsonline.informs.org/doi/10.1287/ijoc.1120.0499,Bin Packing,"Packing, Cutting & Loading","[""Packing, Cutting & Loading::Bin Packing""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
-salemi2022,On the Structure of Decision Diagram-Representable Mixed Integer Programs with Application to Unit Commitment,Operations Research,2022,min,Scheduling,strategic,MILP,Energy & Power Systems,489600.0,7200.0,1238956.0,https://doi.org/10.1287/opre.2022.2353,Unit Commitment,Scheduling,"[""Scheduling::Unit Commitment""]",[],[],linear,stochastic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
+salemi2022,On the Structure of Decision Diagram-Representable Mixed Integer Programs with Application to Unit Commitment,Operations Research,2022,min,Scheduling,operational,MILP,Energy & Power Systems,489600.0,7200.0,1238956.0,https://doi.org/10.1287/opre.2022.2353,Unit Commitment,Scheduling,"[""Scheduling::Unit Commitment""]",[],[],linear,stochastic,"[""none""]",linear,Mixed-integer / mixed-discrete linear,mixed_continuous_discrete,single_level
 sansegundo2023,CliSAT: A new exact algorithm for hard maximum clique problems,European Journal of Operational Research,2023,max,Graph Optimization,planning,BIP,Foundational / Theoretical,1000.0,1000.0,399124.0,https://www.sciencedirect.com/science/article/pii/S0377221722008165,Maximum Clique,Graph Optimization,"[""Graph Optimization::Maximum Clique""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 savelsbergh1997,A Branch-and-Price Algorithm for the Generalized Assignment Problem,Operations Research,1997,max,Assignment & Matching,strategic,BIP,Foundational / Theoretical,2000.0,2000.0,120.0,https://doi.org/10.1287/opre.45.6.831,Generalized Assignment,Assignment & Matching,"[""Assignment & Matching::Generalized Assignment""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level
 segundo2019,A new branch-and-bound algorithm for the maximum edge-weighted clique problem,European Journal of Operational Research,2019,max,Graph Optimization,planning,BIP,Foundational / Theoretical,627430.0,627430.0,3748680.0,https://www.sciencedirect.com/science/article/abs/pii/S0377221719303054,Maximum Clique,Graph Optimization,"[""Graph Optimization::Maximum Clique""]",[],[],linear,deterministic,"[""none""]",linear,Binary linear,binary,single_level