paper_id stringlengths 6 17 | paper_title stringlengths 34 162 | publication stringclasses 21
values | year int64 1.99k 2.03k | direction stringclasses 2
values | problem_class stringlengths 16 42 | category stringclasses 3
values | formulation_type stringclasses 9
values | application_field stringclasses 13
values | avg_num_var float64 1 100M | avg_num_int_var float64 0 10M | avg_num_constr float64 0 11.5M | source_link stringlengths 32 71 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
adulyasak2015 | Benders Decomposition for Production Routing Under Demand Uncertainty | Operations Research | 2,015 | min | Lot Sizing / Inventory | operational | Stochastic/Robust/DRO | Supply Chain & Inventory | 920,934 | 8,934 | 953,310 | https://doi.org/10.1287/opre.2015.1401 |
wangk2020 | A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations | Operations Research | 2,020 | min | Vehicle Scheduling | operational | Stochastic/Robust/DRO | Aerospace & Aviation | 2,270,298 | 1,861,248 | 6,929,616 | https://doi.org/10.1287/opre.2020.1985 |
wangy2020 | The Rank-One Quadratic Assignment Problem | INFORMS Journal on Computing | 2,020 | min | Other (Quadratic Assignment) | planning | QP/MIQP | Foundational / Theoretical | 4,000,035 | 4,000,017 | 4,070 | https://pubsonline.informs.org/doi/10.1287/ijoc.2020.1003 |
alba2013 | A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks | INFORMS Journal on Computing | 2,013 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 840 | 840 | 544 | https://doi.org/10.1287/ijoc.1110.0489 |
alfieri2020 | Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring | Proceedings of the AAAI Conference on Artificial Intelligence | 2,022 | min | Graph Optimization | operational | IP | Foundational / Theoretical | 36,018 | 36,018 | 721,747 | https://doi.org/10.1609/aaai.v36i9.21230 |
amaldi2013 | Column Generation for the Minimum Hyperplanes Clustering Problem | INFORMS Journal on Computing | 2,013 | min | Other (Clustering) | planning | MIP | Foundational / Theoretical | 10,300 | 10,050 | 30,249 | https://doi.org/10.1287/ijoc.1120.0513 |
araujo2015 | Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times | INFORMS Journal on Computing | 2,015 | min | Lot Sizing / Inventory | planning | MIP | Manufacturing & Production | 2,172 | 720 | 1,512 | https://pubsonline.informs.org/doi/10.1287/ijoc.2014.0636 |
araujo2020 | Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes | Computers & Operations Research | 2,020 | min | Other (Project Scheduling) | strategic | MIP | Manufacturing & Production | 290,244 | 290,244 | 146,754 | https://doi.org/10.1016/j.cor.2019.104782 |
archetti2007 | A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem | Transportation Science | 2,007 | min | Lot Sizing / Inventory | operational | MIP | Supply Chain & Inventory | 8,613 | 7,956 | 11,981 | https://doi.org/10.1287/trsc.1060.0188 |
armbruster2012 | LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison | Mathematical Programming Computation | 2,012 | min | Graph Optimization | planning | SDP | Foundational / Theoretical | 129,581 | 129,581 | 451,734 | https://link.springer.com/article/10.1007/s12532-012-0040-5 |
carosi2019 | A matheuristic for integrated timetabling and vehicle scheduling | Transportation Research Part B | 2,019 | min | Vehicle Scheduling | strategic | MIP | Public Transit & Mobility | 1,042,742 | 53,088 | 19,982 | https://doi.org/10.1016/j.trb.2019.07.004 |
bard2002 | A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows | Transportation Science | 2,002 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 3,998 | 3,798 | 13,699 | https://doi.org/10.1287/trsc.36.2.250.565 |
barnhart2000 | Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems | Operations Research | 2,000 | min | Network Design & Flow | planning | IP | Transportation & Logistics | 76,635 | 76,635 | 29,380 | https://doi.org/10.1287/opre.48.2.318.12378 |
bayani2024 | A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization | INFORMS Journal on Computing | 2,024 | min | Other (Quadratic Optimization) | planning | QP/MIQP | Foundational / Theoretical | 74,725 | 700 | 222,125 | https://doi.org/10.1287/ijoc.2021.0186 |
belvaux2000 | bc-prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems | Management Science | 2,000 | min | Lot Sizing / Inventory | strategic | MIP | Manufacturing & Production | 3,300 | 1,800 | 3,990 | https://doi.org/10.1287/mnsc.46.5.724.12048 |
bentert2022 | Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments | INFORMS Journal on Computing | 2,022 | min | Graph Optimization | planning | MIP | Telecommunications & Networking | 8,177 | 2,701 | 10,878 | https://doi.org/10.1287/ijoc.2020.1045 |
bergman2019 | An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating | INFORMS Journal on Computing | 2,019 | max | Packing / Cutting Stock | operational | QP/MIQP | Sports & Entertainment | 350 | 350 | 45 | https://doi.org/10.1287/ijoc.2018.0840 |
bertsimas2022 | A Scalable Algorithm for Sparse Portfolio Selection | INFORMS Journal on Computing | 2,022 | min | Portfolio Optimization | strategic | MIP | Finance & Investment | 3,000 | 1,000 | 2 | https://doi.org/10.1287/ijoc.2021.1127 |
bertsimas2024 | A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design | INFORMS Journal on Computing | 2,024 | min | Network Design & Flow | planning | Stochastic/Robust/DRO | Telecommunications & Networking | 1,170,900 | 900 | 322,501 | https://pubsonline.informs.org/doi/10.1287/ijoc.2023.0074 |
bettinelli2017 | A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph | INFORMS Journal on Computing | 2,017 | max | Packing / Cutting Stock | planning | BIP | Foundational / Theoretical | 500 | 500 | 18,436 | https://pubsonline.informs.org/doi/10.1287/ijoc.2016.0742 |
bierwirth2017 | Extended GRASP for the Job Shop Scheduling Problem with Total Weighted Tardiness Objective | European Journal of Operational Research | 2,017 | min | Scheduling (Machine / Crew / Workforce) | operational | CP | Manufacturing & Production | 4,710 | 4,350 | 9,060 | https://doi.org/10.1016/j.ejor.2017.03.030 |
bode2012 | Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem | Operations Research | 2,012 | min | Vehicle Routing & TSP | operational | IP | Transportation & Logistics | 350 | 350 | 112 | https://doi.org/10.1287/opre.1120.1079 |
bodur2017 | Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse | INFORMS Journal on Computing | 2,017 | min | Stochastic / Robust / Bilevel Optimization | strategic | Stochastic/Robust/DRO | Foundational / Theoretical | 3,750,050 | 50 | 150,001 | https://doi.org/10.1287/ijoc.2016.0717 |
boland2019 | Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets | INFORMS Journal on Computing | 2,019 | min | Facility Location | planning | MIP | Supply Chain & Inventory | 7,260 | 7,260 | 7,380 | https://pubsonline.informs.org/doi/10.1287/ijoc.2018.0846 |
bollapragada2001 | Optimal Design of Truss Structures by Logic-Based Branch and Cut | Operations Research | 2,001 | min | Other (Structural Design) | planning | MIP | Foundational / Theoretical | 6,840 | 2,160 | 11,004 | https://doi.org/10.1287/opre.49.1.42.11196 |
borndorfer2007 | A Column-Generation Approach to Line Planning in Public Transport | Transportation Science | 2,007 | min | Other (Line Planning) | planning | IP | Public Transit & Mobility | 166,848 | 50,569 | 61,961 | https://doi.org/10.1287/trsc.1060.0161 |
bragin2022 | Surrogate "Level-Based" Lagrangian Relaxation for mixed-integer linear programming | Scientific Reports | 2,022 | min | Other (General MIP) | planning | MIP | Foundational / Theoretical | 128,000 | 128,000 | 1,680 | https://www.nature.com/articles/s41598-022-26264-1 |
brandao2016 | Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression | Computers & Operations Research | 2,016 | min | Packing / Cutting Stock | planning | IP | Foundational / Theoretical | 82,000 | 82,000 | 7,165 | https://www.sciencedirect.com/science/article/abs/pii/S0305054815002762 |
bront2009 | A Column Generation Algorithm for Choice-Based Network Revenue Management | Operations Research | 2,009 | max | Other (Revenue Management) | strategic | IP | Retail & Revenue Management | 1 | 0 | 13 | https://doi.org/10.1287/opre.1080.0567 |
buchheim2018 | Quadratic Combinatorial Optimization Using Separable Underestimators | INFORMS Journal on Computing | 2,018 | min | Other (Quadratic Optimization) | planning | QP/MIQP | Foundational / Theoretical | 420 | 420 | 225 | https://doi.org/10.1287/ijoc.2017.0789 |
byeon2022 | Benders Subproblem Decomposition for Bilevel Problems with Convex Follower | INFORMS Journal on Computing | 2,022 | min | Stochastic / Robust / Bilevel Optimization | planning | Bilevel/Multi-level | Foundational / Theoretical | 6,828 | 774 | 10,693 | https://doi.org/10.1287/ijoc.2021.1128 |
caprara1999 | Exact Solution of the Quadratic Knapsack Problem | INFORMS Journal on Computing | 1,999 | max | Other (Quadratic Knapsack) | planning | QP/MIQP | Foundational / Theoretical | 90,000 | 90,000 | 134,851 | https://pubsonline.informs.org/doi/10.1287/ijoc.11.2.125 |
carvalho1999 | Exact solution of bin-packing problems using column generation and branch-and-bound | Annals of Operations Research | 1,999 | min | Packing / Cutting Stock | planning | IP | Foundational / Theoretical | 38,404 | 38,404 | 1,232 | https://link.springer.com/article/10.1023/A:1018952112615 |
carvalho2022 | Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup | European Journal of Operational Research | 2,022 | min | Lot Sizing / Inventory | strategic | MIP | Manufacturing & Production | 30,390 | 13,290 | 23,333 | https://doi.org/10.1016/j.ejor.2021.03.050 |
castro2021 | A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks | European Journal of Operational Research | 2,021 | min | Other (Network Flow) | strategic | NLP/MINLP | Foundational / Theoretical | 100,000,000 | 0 | 500,200 | https://doi.org/10.1016/j.ejor.2020.10.027 |
chebil2015 | A dynamic programming algorithm for the Knapsack Problem with Setup | Computers & Operations Research | 2,015 | max | Packing / Cutting Stock | planning | IP | Foundational / Theoretical | 10,030 | 10,030 | 10,001 | https://www.sciencedirect.com/science/article/abs/pii/S0305054815001215 |
chebil2019 | An exact approach for the 0–1 Knapsack Problem with Setups | Computers & Operations Research | 2,017 | max | Packing / Cutting Stock | planning | BIP | Foundational / Theoretical | 50,100 | 50,100 | 50,001 | https://doi.org/10.1016/j.cor.2016.11.015 |
chen1999 | Solving Parallel Machine Scheduling Problems by Column Generation | INFORMS Journal on Computing | 1,999 | min | Other (Parallel Machine Scheduling) | strategic | IP | Manufacturing & Production | 101,200 | 51,600 | 149,810 | https://doi.org/10.1287/ijoc.11.1.78 |
cherkesly2015 | Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading | Transportation Science | 2,015 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 1,048,880 | 1,029,000 | 2,415,979 | https://doi.org/10.1287/trsc.2014.0535 |
colombi2017 | The directed profitable rural postman problem with incompatibility constraints | European Journal of Operational Research | 2,017 | max | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 8,453 | 2,635 | 8,028 | https://doi.org/10.1016/j.ejor.2017.02.002 |
contreras2011 | Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment | INFORMS Journal on Computing | 2,011 | min | Facility Location | planning | MIP | Transportation & Logistics | 2,561,600 | 1,600 | 131,241 | https://doi.org/10.1287/ijoc.1100.0391 |
cordeau2006 | A Branch-and-Cut Algorithm for the Dial-a-Ride Problem | Operations Research | 2,006 | min | Vehicle Routing & TSP | operational | MIP | Public Transit & Mobility | 11,456 | 11,260 | 4,349 | https://doi.org/10.1287/opre.1060.0283 |
cordeau2014 | Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem | Transportation Science | 2,014 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 41,412 | 41,412 | 408 | https://doi.org/10.1287/trsc.1120.0449 |
cordeau2019 | Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems | European Journal of Operational Research | 2,019 | min | Facility Location | planning | MIP | Public Service & Government | 100,100 | 100 | 100,001 | https://www.sciencedirect.com/science/article/abs/pii/S0377221718310737 |
cote2018 | The Meet-in-the-Middle Principle for Cutting and Packing Problems | INFORMS Journal on Computing | 2,018 | min | Packing / Cutting Stock | planning | BIP | Foundational / Theoretical | 67,310 | 67,310 | 21,292 | https://pubsonline.informs.org/doi/10.1287/ijoc.2018.0806 |
cunha2021 | Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure | European Journal of Operational Research | 2,021 | min | Lot Sizing / Inventory | planning | MIP | Supply Chain & Inventory | 19,890 | 6,630 | 13,260 | https://www.sciencedirect.com/science/article/abs/pii/S0377221721002551 |
damcikurt2016 | Strong Formulations for the Multistage Stochastic Self-Scheduling Unit Commitment | Operations Research | 2,016 | max | Energy & Unit Commitment | operational | Stochastic/Robust/DRO | Energy & Power Systems | 3,145,724 | 2,097,149 | 11,534,314 | https://doi.org/10.1287/opre.2016.1520 |
dayarian2019 | A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products | Transportation Science | 2,019 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 19,310 | 16,964 | 35,831 | https://doi.org/10.1287/trsc.2018.0854 |
degraeve2007 | A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot Sizing Problem with Set Up Times | INFORMS Journal on Computing | 2,007 | min | Lot Sizing / Inventory | planning | MIP | Manufacturing & Production | 1,830 | 600 | 1,220 | https://pubsonline.informs.org/doi/10.1287/opre.1070.0404 |
delage2022 | Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems | INFORMS Journal on Computing | 2,022 | min | Packing / Cutting Stock | strategic | CP | Manufacturing & Production | 5,910 | 2,520 | 8,400 | https://doi.org/10.1287/ijoc.2021.1079 |
delorme2020 | Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems | INFORMS Journal on Computing | 2,019 | min | Packing / Cutting Stock | planning | IP | Foundational / Theoretical | 1,641,755 | 1,641,755 | 5,467 | https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2018.0880 |
desaulniers2010 | Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows | Operations Research | 2,010 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 98,817 | 92,289 | 99,008 | https://doi.org/10.1287/opre.1090.0713 |
desaulniers2014 | A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem | Les Cahiers du GERAD | 2,014 | min | Lot Sizing / Inventory | operational | MIP | Supply Chain & Inventory | 15,753 | 7,800 | 8,709 | https://doi.org/10.1287/trsc.2015.0635 |
desaulniers2016 | A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem | Transportation Science | 2,016 | min | Lot Sizing / Inventory | operational | MIP | Supply Chain & Inventory | 33,213 | 31,725 | 32,868 | https://doi.org/10.1287/trsc.2015.0635 |
dienstknecht2024 | Sharing in construction projects: On determining optimal container assignments for the on-site accommodation of trades | European Journal of Operational Research | 2,024 | min | Other (Resource Assignment) | strategic | MIP | Manufacturing & Production | 14,560 | 7,378 | 23,714 | https://doi.org/10.1016/j.ejor.2023.11.045 |
lai2021 | Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping | European Journal of Operational Research | 2,021 | max | Other (Grouping / Partitioning) | planning | MIP | Foundational / Theoretical | 20,000 | 20,000 | 500 | https://www.sciencedirect.com/science/article/abs/pii/S0377221720306743 |
elci2022 | Stochastic Planning and Scheduling with Logic-Based Benders Decomposition | INFORMS Journal on Computing | 2,022 | min | Scheduling (Machine / Crew / Workforce) | strategic | Stochastic/Robust/DRO | Manufacturing & Production | 1,525,989 | 1,525,864 | 1,617,160 | https://doi.org/10.1287/ijoc.2022.1184 |
engineer2012 | A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing | Operations Research | 2,012 | min | Lot Sizing / Inventory | operational | MIP | Supply Chain & Inventory | 13,456 | 6,588 | 14,305 | https://doi.org/10.1287/opre.1110.0997 |
schwerdfeger2016 | A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines | Computers & Operations Research | 2,016 | min | Scheduling (Machine / Crew / Workforce) | strategic | IP | Manufacturing & Production | 3,934 | 3,920 | 294 | https://doi.org/10.1016/j.cor.2016.03.008 |
fischetti1997 | A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem | Operations Research | 1,997 | min | Vehicle Routing & TSP | operational | IP | Transportation & Logistics | 96,814 | 96,814 | 39,516 | https://doi.org/10.1287/opre.45.3.378 |
fischetti1998 | Solving the Orienteering Problem through Branch-and-Cut | INFORMS Journal on Computing | 1,998 | max | Vehicle Routing & TSP | operational | IP | Transportation & Logistics | 125,250 | 125,250 | 249,503 | https://doi.org/10.1287/ijoc.10.2.133 |
fischetti2017 | Redesigning Benders Decomposition for Large-Scale Facility Location | Management Science | 2,016 | min | Facility Location | planning | MIP | Transportation & Logistics | 933,380 | 140 | 469,953 | https://pubsonline.informs.org/doi/10.1287/mnsc.2016.2461 |
fleszar2022b | A branch-and-bound algorithm for the quadratic multiple knapsack problem | European Journal of Operational Research | 2,022 | max | Packing / Cutting Stock | planning | QP/MIQP | Foundational / Theoretical | 600 | 600 | 70 | https://www.sciencedirect.com/science/article/abs/pii/S0377221721005336 |
samarghandi2017 | On the exact solution of the no-wait flow shop problem with due date constraints | Computers & Operations Research | 2,017 | min | Scheduling (Machine / Crew / Workforce) | operational | IP | Manufacturing & Production | 601 | 400 | 4,271 | https://doi.org/10.1016/j.cor.2016.12.013 |
forrest2006 | A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints | INFORMS Journal on Computing | 2,006 | max | Other (Knapsack) | strategic | IP | Manufacturing & Production | 82,355 | 82,355 | 75,237 | https://doi.org/10.1287/ijoc.1040.0078 |
fragkos2016 | A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times | INFORMS Journal on Computing | 2,016 | min | Lot Sizing / Inventory | strategic | MIP | Manufacturing & Production | 3,010 | 1,000 | 2,110 | https://doi.org/10.1287/ijoc.2016.0691 |
fragkos2021 | A General Model and Efficient Algorithms for Reliable Facility Location Problem under Uncertain Disruptions | INFORMS Journal on Computing | 2,021 | min | Facility Location | planning | Stochastic/Robust/DRO | Transportation & Logistics | 10,001 | 10,000 | 0 | https://doi.org/10.1287/ijoc.2021.1063 |
eiselt2009 | A conditional p-hub location problem with attraction functions | Computers & Operations Research | 2,009 | max | Facility Location | planning | MIP | Aerospace & Aviation | 195,925 | 325 | 586,201 | https://doi.org/10.1016/j.cor.2008.11.014 |
freeman2018 | Attractive Orienteering Problem with Proximity and Timing Interactions | European Journal of Operational Research | 2,018 | max | Vehicle Routing & TSP | strategic | MIP | Sports & Entertainment | 234,930 | 1,710 | 692,599 | https://doi.org/10.1016/j.ejor.2017.09.025 |
freling2003 | A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem | Operations Research | 2,003 | min | Facility Location | strategic | MIP | Manufacturing & Production | 1,974 | 1,890 | 219 | https://doi.org/10.1287/opre.51.6.922.24914 |
frey2017 | Column Generation for Outbound Baggage Handling at Airports | Transportation Science | 2,017 | min | Other (Airport Scheduling) | operational | MIP | Aerospace & Aviation | 1,205,240 | 1,156,189 | 62,996 | https://doi.org/10.1287/trsc.2017.0739 |
furini2016 | Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming | INFORMS Journal on Computing | 2,016 | max | Packing / Cutting Stock | operational | MIP | Manufacturing & Production | 3,281,559 | 3,281,559 | 37,797 | https://doi.org/10.1287/ijoc.2016.0710 |
furini2017 | An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem | Networks | 2,017 | min | Graph Optimization | planning | BIP | Foundational / Theoretical | 1,029 | 1,029 | 14,465 | https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21716 |
furini2019 | A Branch and Bound Algorithm for the Maximum Clique Problem | Computers & Operations Research | 1,992 | max | Graph Optimization | planning | BIP | Foundational / Theoretical | 1,000 | 1,000 | 349,500 | https://doi.org/10.1016/0305-0548(92)90067-f |
furini2021 | A branch-and-cut algorithm for the Edge Interdiction Clique Problem | European Journal of Operational Research | 2,021 | min | Graph Optimization | planning | BIP | Foundational / Theoretical | 2,543 | 2,543 | 2 | https://www.sciencedirect.com/science/article/abs/pii/S0377221721000606 |
gamache1999 | A Column Generation Approach for Large-Scale Aircrew Rostering Problems | Operations Research | 1,999 | min | Scheduling (Machine / Crew / Workforce) | strategic | MIP | Aerospace & Aviation | 228,907 | 228,875 | 82 | https://doi.org/10.1287/opre.47.2.247 |
garcia2011 | Solving Large p-Median Problems with a Radius Formulation | INFORMS Journal on Computing | 2,011 | min | Facility Location | planning | MIP | Foundational / Theoretical | 88,397 | 300 | 88,098 | https://pubsonline.informs.org/doi/10.1287/ijoc.1100.0418 |
gruson2021 | Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure | European Journal of Operational Research | 2,021 | min | Lot Sizing / Inventory | planning | Stochastic/Robust/DRO | Supply Chain & Inventory | 4,825,320 | 1,320 | 4,824,088 | https://doi.org/10.1016/j.ejor.2020.09.019 |
gschwind2021 | A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques | INFORMS Journal on Computing | 2,021 | min | Graph Optimization | operational | MIP | Foundational / Theoretical | 500 | 0 | 500 | https://doi.org/10.1287/ijoc.2020.0984 |
gualandi2012 | Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation | INFORMS Journal on Computing | 2,012 | min | Graph Optimization | planning | CP | Foundational / Theoretical | 10,251 | 10,251 | 634,540 | https://pubsonline.informs.org/doi/10.1287/ijoc.1100.0436 |
guo2021 | Logic-based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling | INFORMS Journal on Computing | 2,021 | min | Scheduling (Machine / Crew / Workforce) | operational | Stochastic/Robust/DRO | Healthcare | 568,286 | 568,286 | 575,895 | https://pubsonline.informs.org/doi/10.1287/ijoc.2020.1036 |
hadjar2006 | A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem | Operations Research | 2,006 | min | Vehicle Scheduling | operational | MIP | Public Transit & Mobility | 780,210 | 780,210 | 4,212 | https://doi.org/10.1287/opre.1050.0240 |
hewitt2024 | Production planning under demand and endogenous supply uncertainty | arXiv preprint | 2,025 | max | Stochastic / Robust / Bilevel Optimization | strategic | Stochastic/Robust/DRO | Manufacturing & Production | 307,640 | 2,590 | 551,595 | https://doi.org/10.1287/ijoc.2023.0067 |
hoffman1993 | Solving Airline Crew Scheduling Problems by Branch-and-Cut | Management Science | 1,993 | min | Scheduling (Machine / Crew / Workforce) | strategic | MIP | Aerospace & Aviation | 15,000 | 15,000 | 100 | https://doi.org/10.1287/mnsc.39.6.657 |
hosseinian2020 | A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem | INFORMS Journal on Computing | 2,020 | max | Graph Optimization | planning | MIP | Foundational / Theoretical | 40,300 | 40,300 | 119,700 | https://pubsonline.informs.org/doi/10.1287/ijoc.2019.0898 |
huisman2005 | Multiple-Depot Integrated Vehicle and Crew Scheduling | Transportation Science | 2,005 | min | Vehicle Scheduling | operational | MIP | Public Transit & Mobility | 287,214 | 287,214 | 1,512 | https://doi.org/10.1287/trsc.1040.0104 |
ji2019 | Exact and heuristic methods for optimizing lock-quay system in inland waterway | European Journal of Operational Research | 2,019 | min | Other (Container Terminal) | strategic | MIP | Transportation & Logistics | 3,738 | 2,274 | 7,261 | https://doi.org/10.1016/j.ejor.2019.03.010 |
juvin2023 | Logic-based Benders decomposition for the preemptive Flexible Job-Shop Scheduling Problem | Computers & Operations Research | 2,023 | min | Scheduling (Machine / Crew / Workforce) | operational | CP | Manufacturing & Production | 39,828 | 39,827 | 111,343 | https://doi.org/10.1016/j.cor.2023.106156 |
kang2021 | An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem | Transportation Science | 2,021 | min | Vehicle Routing & TSP | operational | MIP | Transportation & Logistics | 7,654 | 7,551 | 2,809 | https://doi.org/10.1287/trsc.2021.1055 |
klose2005 | Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation | Management Science | 2,005 | min | Facility Location | planning | MIP | Transportation & Logistics | 1,125,750 | 750 | 1,127,251 | https://doi.org/10.1287/mnsc.1050.0410 |
knueven2020 | On Mixed Integer Programming Formulations for the Unit Commitment Problem | INFORMS Journal on Computing | 2,020 | min | Energy & Unit Commitment | operational | MIP | Energy & Power Systems | 450,144 | 129,600 | 623,040 | https://doi.org/10.1287/ijoc.2019.0944 |
kobayashi2021 | Bilevel Cutting-plane Algorithm for Solving Cardinality-constrained Mean-CVaR Portfolio Optimization Problems | Journal of Global Optimization | 2,021 | min | Portfolio Optimization | strategic | Bilevel/Multi-level | Finance & Investment | 10,452 | 225 | 10,229 | https://doi.org/10.1007/s10898-021-01048-5 |
kobeaga2024 | A revisited branch-and-cut algorithm for large-scale orienteering problems | European Journal of Operational Research | 2,024 | max | Graph Optimization | operational | MIP | Foundational / Theoretical | 45,150 | 45,150 | 90,002 | https://www.sciencedirect.com/science/article/pii/S0377221723005933 |
kowalczyk2018 | A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching | INFORMS Journal on Computing | 2,018 | min | Scheduling (Machine / Crew / Workforce) | strategic | IP | Manufacturing & Production | 284,784 | 284,784 | 31 | https://doi.org/10.1287/ijoc.2018.0809 |
kowalczyk2024 | A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams | INFORMS Journal on Computing | 2,024 | min | Scheduling (Machine / Crew / Workforce) | strategic | IP | Manufacturing & Production | 130,970 | 65,485 | 65,536 | https://doi.org/10.1287/ijoc.2022.0301 |
kress2019 | An Exact Solution Approach for Scheduling Cooperative Gantry Cranes | European Journal of Operational Research | 2,019 | min | Other (Container Terminal) | strategic | IP | Transportation & Logistics | 47,600 | 47,029 | 65,965 | https://doi.org/10.1016/j.ejor.2018.07.045 |
kreter2018 | Mixed-Integer Linear Programming and Constraint Programming Formulations for Solving Resource Availability Cost Problems | European Journal of Operational Research | 2,018 | min | Other (Project Scheduling) | planning | MIP | Manufacturing & Production | 52,059 | 52,055 | 110,513 | https://doi.org/10.1016/j.ejor.2017.10.014 |
laporte2003 | A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem | Operations Research | 2,003 | min | Vehicle Routing & TSP | operational | IP | Transportation & Logistics | 10,091 | 5,050 | 5,440 | https://doi.org/10.1287/opre.51.6.940.24921 |
lee1996 | A Branch and Cut Algorithm for a Steiner Tree-Star Problem | INFORMS Journal on Computing | 1,996 | min | Graph Optimization | planning | IP | Telecommunications & Networking | 12,985 | 70 | 15,621 | https://doi.org/10.1287/ijoc.8.3.194 |
legrain2020 | A rotation-based branch-and-price approach for the nurse scheduling problem | Mathematical Programming Computation | 2,020 | min | Scheduling (Machine / Crew / Workforce) | strategic | IP | Healthcare | 176,408 | 104,672 | 183,512 | https://link.springer.com/article/10.1007/s12532-019-00172-4 |
FrontierOR Audited 180
This is an evaluator-oriented derivative of
SmartOR/FrontierOR, pinned to
upstream commit 37ccd8b6dca3bf7f4e0c58941a6ed156832a6d9e. The released descriptions, formulations, Gurobi
implementations, solution schemas, reference solutions, and feasibility checkers were
audited and repaired as one evaluation contract.
Final status
| Gate | Result |
|---|---|
| Evaluator-ready directory IDs | 180/180 |
| Independent canonical cases | 179 |
| Transparent compatibility aliases | 1 |
| Official instance/solution replay | 1,095/1,095 accepted |
| Bundled checker-result comparison | 1,095/1,095 match |
| Evaluator objective preflight | 180/180 passed |
| Checker mutation audit | 180/180 covered; 9 former runtime-solver cases repaired |
| Solver-free complete-witness replay | 54/54 accepted |
| Solver-free objective/variable mutations | 54/54 + 54/54 rejected |
The compatibility alias is ostrowski2012 -> earl2005. The upstream
ostrowski2012 directory was a mislabeled byte-level duplicate of the Earl/D'Andrea
2005 defensive-drill task and had no canonical metadata row. It is retained so that
existing 180-directory evaluation code does not break, and its alias status is
disclosed in the prompt, formulation, model, checker, and CASE_IDENTITY.json.
What “audited” means
For every published instance, its bundled solution is finite, accepted by the current
checker, and has a bundled checker result matching a fresh replay. Objective-tamper
preflight and decision-erasure mutation probes were also run. The nine checkers
that formerly reconstructed omitted decisions with Gurobi now receive complete
operational witnesses. They validate bounds, domains, constraints, and objectives
by direct numeric substitution. Their 54-pair regression and mutation results are
recorded in audit/SOLVERLESS_CHECKER_AUDIT.json.
The static triad scan is deliberately heuristic and still reports lexical findings; those findings are retained for transparency and are not runtime failures.
Optimality boundary
“Accepted” means a complete checker-verifiable feasible evaluation baseline. It
does not mean that every historical large incumbent was re-proved globally optimal.
For the 1,095 published references, the provenance classes are explicit_incumbent=398, solver_optimal=474, solver_optimal_with_tolerance=77, objective_without_certificate=138, ambiguous_status=8. In total,
544 published references across 128 cases do not carry a global-optimality
certificate. No feasible incumbent has been relabeled as a proven optimum.
Layout
Each case directory contains its description, formulation, schemas, generation
code, checker, official instances, paired solutions, paired feasibility results,
and any matching solver logs. Cases using generic solver-free witness checking
also contain trusted compressed coefficients under solverless_models/. Gurobi
can still be used offline to regenerate reference solutions, but it is not needed
to run any released feasibility checker. Two legacy segundo2019 solutions
without corresponding instances are excluded from this release.
RELEASE_MANIFEST_180.json: case identities and all 1,095 official pair bindings.audit/: final per-case matrix, change manifest, and compact gate summaries.PUBLISH_FILE_MANIFEST.jsonandSHA256SUMS: complete file inventory and hashes.
Metadata can be loaded with:
from datasets import load_dataset
meta = load_dataset("LeoJiangOR/FrontierOR-Audited-180", "meta", split="train")
print(meta[0])
Download the complete self-contained task tree with:
hf download LeoJiangOR/FrontierOR-Audited-180 --repo-type dataset --local-dir frontieror-audited-180
Provenance and license
- Upstream dataset commit:
37ccd8b6dca3bf7f4e0c58941a6ed156832a6d9e - Evaluator commit:
93fb106d98c9d21729aa846f29822e12ad22db90 - Audit/release date: 2026-08-29 (America/New_York)
The upstream dataset card declares CC-BY-4.0. This derivative retains that license
and attribution; see LICENSE.md and UPSTREAM_README.md.
- Downloads last month
- 122