Datasets:

frontieror
/

FrontierOR

paper_id string	paper_title string	publication string	year int64	direction string	problem_class string	category string	formulation_type string	application_field string	avg_num_var float64	avg_num_int_var float64	avg_num_constr float64	source_link string	problem_subclass string	problem_class_primary string	problem_class_structural_labels list	problem_class_compound_labels list	problem_class_components list	formulation_objective string	formulation_uncertainty string	formulation_special_constraints list	formulation_constraints string	formulation_family string	formulation_variables string	formulation_hierarchy string
adulyasak2015	Benders Decomposition for Production Routing Under Demand Uncertainty	Operations Research	2,015	min	Routing	operational	MILP	Supply Chain & Inventory	920,934	8,934	953,310	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	2,020	min	Scheduling	operational	MILP	Aerospace & Aviation	2,270,298	1,861,248	6,929,616	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	2,020	min	Assignment & Matching	planning	BQP	Foundational / Theoretical	4,000,035	4,000,017	4,070	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	2,013	min	Routing	operational	BIP	Transportation & Logistics	840	840	544	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	2,022	min	Graph Optimization	operational	BIP	Foundational / Theoretical	36,018	36,018	721,747	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
amaldi2013	Column Generation for the Minimum Hyperplanes Clustering Problem	INFORMS Journal on Computing	2,013	min	Clustering & Districting	planning	MINLP	Foundational / Theoretical	10,300	10,050	30,249	https://doi.org/10.1287/ijoc.1120.0513	Clustering	Clustering & Districting	[ "Clustering & Districting::Clustering" ]	[]	[]	linear	deterministic	[ "none" ]	general_nonlinear	Nonlinear	mixed_continuous_discrete	single_level
araujo2015	Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times	INFORMS Journal on Computing	2,015	min	Inventory & Lot Sizing	planning	MILP	Manufacturing & Production	2,172	720	1,512	https://pubsonline.informs.org/doi/10.1287/ijoc.2014.0636	Multi-Item Lot Sizing	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Multi-Item Lot Sizing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
araujo2020	Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes	Computers & Operations Research	2,020	min	Scheduling	strategic	IP	Manufacturing & Production	290,244	290,244	146,754	https://doi.org/10.1016/j.cor.2019.104782	Project Scheduling	Scheduling	[ "Scheduling::Project Scheduling" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Integer linear	integer	single_level
archetti2007	A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem	Transportation Science	2,007	min	Routing	operational	Mixed-discrete disjunctive program	Supply Chain & Inventory	8,613	7,956	11,981	https://doi.org/10.1287/trsc.1060.0188	Capacitated VRP	Routing	[ "Routing::Capacitated VRP", "Inventory & Lot Sizing::Inventory Control" ]	[ "Inventory & Lot Sizing::Inventory Control" ]	[]	linear	deterministic	[ "general_disjunction" ]	linear	Disjunctive	mixed_continuous_discrete	single_level
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	BIP	Foundational / Theoretical	129,581	129,581	451,734	https://link.springer.com/article/10.1007/s12532-012-0040-5	Graph Partitioning	Graph Optimization	[ "Graph Optimization::Graph Partitioning" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
carosi2019	A matheuristic for integrated timetabling and vehicle scheduling	Transportation Research Part B	2,019	min	Scheduling	strategic	MILP	Public Transit & Mobility	1,042,742	53,088	19,982	https://doi.org/10.1016/j.trb.2019.07.004	Integrated Timetabling and Vehicle Scheduling	Scheduling	[ "Scheduling::Integrated Timetabling and Vehicle Scheduling" ]	[]	[ { "family": "Scheduling", "subtype": "Timetabling" }, { "family": "Scheduling", "subtype": "Vehicle Scheduling" } ]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
bard2002	A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows	Transportation Science	2,002	min	Routing	operational	MILP	Transportation & Logistics	3,998	3,798	13,699	https://doi.org/10.1287/trsc.36.2.250.565	VRP with Time Windows	Routing	[ "Routing::VRP with Time Windows" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
barnhart2000	Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems	Operations Research	2,000	min	Network Flow	planning	BIP	Transportation & Logistics	76,635	76,635	29,380	https://doi.org/10.1287/opre.48.2.318.12378	Multicommodity Flow	Network Flow	[ "Network Flow::Multicommodity Flow" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
bayani2024	A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization	INFORMS Journal on Computing	2,024	min	Assignment & Matching	planning	BQP	Foundational / Theoretical	74,725	700	222,125	https://doi.org/10.1287/ijoc.2021.0186	Quadratic Semi-Assignment	Assignment & Matching	[ "Assignment & Matching::Quadratic Semi-Assignment" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
belvaux2000	bc-prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems	Management Science	2,000	min	Inventory & Lot Sizing	strategic	MILP	Manufacturing & Production	3,300	1,800	3,990	https://doi.org/10.1287/mnsc.46.5.724.12048	Multi-Item Lot Sizing	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Multi-Item Lot Sizing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
bentert2022	Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments	INFORMS Journal on Computing	2,022	min	Network Design	planning	Combinatorial (non-algebraic)	Telecommunications & Networking	8,177	2,701	10,878	https://doi.org/10.1287/ijoc.2020.1045	Min-Power Symmetric Connectivity	Network Design	[ "Network Design::Min-Power Symmetric Connectivity" ]	[]	[]	non_algebraic	deterministic	[ "none" ]	non_algebraic	Combinatorial	non_algebraic	single_level
bergman2019	An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating	INFORMS Journal on Computing	2,019	max	Knapsack & Selection	operational	BQP	Sports & Entertainment	350	350	45	https://doi.org/10.1287/ijoc.2018.0840	Quadratic Knapsack	Knapsack & Selection	[ "Knapsack & Selection::Quadratic Knapsack" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
bertsimas2022	A Scalable Algorithm for Sparse Portfolio Selection	INFORMS Journal on Computing	2,022	min	Knapsack & Selection	strategic	Disjunctive program	Finance & Investment	3,000	1,000	2	https://doi.org/10.1287/ijoc.2021.1127	Portfolio Selection	Knapsack & Selection	[ "Knapsack & Selection::Portfolio Selection" ]	[]	[]	quadratic	deterministic	[ "nonlinear_logical" ]	general_nonlinear	Disjunctive	continuous	single_level
bertsimas2024	A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design	INFORMS Journal on Computing	2,024	min	Network Design	planning	MIQP (linear indicators)	Telecommunications & Networking	1,170,900	900	322,501	https://pubsonline.informs.org/doi/10.1287/ijoc.2023.0074	Fixed-Charge Network Design	Network Design	[ "Network Design::Fixed-Charge Network Design", "Network Flow::Multicommodity Flow" ]	[ "Network Flow::Multicommodity Flow" ]	[]	quadratic	stochastic	[ "linear_indicator" ]	linear	Quadratic	mixed_continuous_discrete	single_level
bettinelli2017	A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph	INFORMS Journal on Computing	2,017	max	Knapsack & Selection	planning	BIP	Foundational / Theoretical	500	500	18,436	https://pubsonline.informs.org/doi/10.1287/ijoc.2016.0742	0-1 Knapsack	Knapsack & Selection	[ "Knapsack & Selection::0-1 Knapsack" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
bierwirth2017	Extended GRASP for the Job Shop Scheduling Problem with Total Weighted Tardiness Objective	European Journal of Operational Research	2,017	min	Scheduling	operational	Combinatorial (non-algebraic)	Manufacturing & Production	4,710	4,350	9,060	https://doi.org/10.1016/j.ejor.2017.03.030	Job-Shop Scheduling	Scheduling	[ "Scheduling::Job-Shop Scheduling" ]	[]	[]	linear	deterministic	[ "none" ]	non_algebraic	Combinatorial	non_algebraic	single_level
bode2012	Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem	Operations Research	2,012	min	Routing	operational	IP	Transportation & Logistics	350	350	112	https://doi.org/10.1287/opre.1120.1079	Arc Routing	Routing	[ "Routing::Arc Routing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Integer linear	integer	single_level
bodur2017	Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse	INFORMS Journal on Computing	2,017	min	Facility Location	strategic	MILP	Foundational / Theoretical	3,750,050	50	150,001	https://doi.org/10.1287/ijoc.2016.0717	Capacitated Facility Location	Facility Location	[ "Facility Location::Capacitated Facility Location" ]	[]	[]	linear	stochastic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
boland2019	Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets	INFORMS Journal on Computing	2,019	min	Facility Location	planning	BIP	Supply Chain & Inventory	7,260	7,260	7,380	https://pubsonline.informs.org/doi/10.1287/ijoc.2018.0846	Capacitated Facility Location	Facility Location	[ "Facility Location::Capacitated Facility Location" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
bollapragada2001	Optimal Design of Truss Structures by Logic-Based Branch and Cut	Operations Research	2,001	min	Network Design	planning	Mixed-discrete QCQP	Foundational / Theoretical	6,840	2,160	11,004	https://doi.org/10.1287/opre.49.1.42.11196	Structural Member Sizing	Network Design	[ "Network Design::Structural Member Sizing" ]	[]	[]	linear	deterministic	[ "finite_domain_disjunction" ]	quadratic	Quadratic	mixed_continuous_finite_discrete	single_level
borndorfer2007	A Column-Generation Approach to Line Planning in Public Transport	Transportation Science	2,007	min	Network Design	planning	MILP	Public Transit & Mobility	166,848	50,569	61,961	https://doi.org/10.1287/trsc.1060.0161	Fixed-Charge Network Design	Network Design	[ "Network Design::Fixed-Charge Network Design", "Network Flow::Multicommodity Flow" ]	[ "Network Flow::Multicommodity Flow" ]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
bragin2022	Surrogate "Level-Based" Lagrangian Relaxation for mixed-integer linear programming	Scientific Reports	2,022	min	Assignment & Matching	planning	BIP	Foundational / Theoretical	128,000	128,000	1,680	https://www.nature.com/articles/s41598-022-26264-1	Generalized Assignment	Assignment & Matching	[ "Assignment & Matching::Generalized Assignment" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
brandao2016	Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression	Computers & Operations Research	2,016	min	Packing, Cutting & Loading	planning	MILP	Foundational / Theoretical	82,000	82,000	7,165	https://www.sciencedirect.com/science/article/abs/pii/S0305054815002762	Bin Packing	Packing, Cutting & Loading	[ "Packing, Cutting & Loading::Bin Packing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
bront2009	A Column Generation Algorithm for Choice-Based Network Revenue Management	Operations Research	2,009	max	Resource Allocation & Blending	strategic	LP	Retail & Revenue Management	1	0	13	https://doi.org/10.1287/opre.1080.0567	Resource Allocation	Resource Allocation & Blending	[ "Resource Allocation & Blending::Resource Allocation" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Continuous linear	continuous	single_level
buchheim2018	Quadratic Combinatorial Optimization Using Separable Underestimators	INFORMS Journal on Computing	2,018	min	Network Flow	planning	BQP	Foundational / Theoretical	420	420	225	https://doi.org/10.1287/ijoc.2017.0789	Shortest Path	Network Flow	[ "Network Flow::Shortest Path" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
byeon2022	Benders Subproblem Decomposition for Bilevel Problems with Convex Follower	INFORMS Journal on Computing	2,022	min	Scheduling	planning	MISOCP	Foundational / Theoretical	6,828	774	10,693	https://doi.org/10.1287/ijoc.2021.1128	Unit Commitment	Scheduling	[ "Scheduling::Unit Commitment", "Network Flow::Physically Constrained Network Flow" ]	[ "Network Flow::Physically Constrained Network Flow" ]	[]	linear	deterministic	[ "none" ]	second_order_conic	Conic / SDP	mixed_continuous_discrete	bilevel
caprara1999	Exact Solution of the Quadratic Knapsack Problem	INFORMS Journal on Computing	1,999	max	Knapsack & Selection	planning	BQP	Foundational / Theoretical	90,000	90,000	134,851	https://pubsonline.informs.org/doi/10.1287/ijoc.11.2.125	Quadratic Knapsack	Knapsack & Selection	[ "Knapsack & Selection::Quadratic Knapsack" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
carvalho1999	Exact solution of bin-packing problems using column generation and branch-and-bound	Annals of Operations Research	1,999	min	Packing, Cutting & Loading	planning	MILP	Foundational / Theoretical	38,404	38,404	1,232	https://link.springer.com/article/10.1023/A:1018952112615	Bin Packing	Packing, Cutting & Loading	[ "Packing, Cutting & Loading::Bin Packing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
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	Scheduling	strategic	MILP	Manufacturing & Production	30,390	13,290	23,333	https://doi.org/10.1016/j.ejor.2021.03.050	Parallel-Machine Scheduling	Scheduling	[ "Scheduling::Parallel-Machine Scheduling", "Inventory & Lot Sizing::Multi-Item Lot Sizing" ]	[ "Inventory & Lot Sizing::Multi-Item Lot Sizing" ]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
castro2021	A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks	European Journal of Operational Research	2,021	min	Network Flow	strategic	NLP	Foundational / Theoretical	100,000,000	0	500,200	https://doi.org/10.1016/j.ejor.2020.10.027	Transportation Problem	Network Flow	[ "Network Flow::Transportation Problem" ]	[]	[]	general_nonlinear	deterministic	[ "none" ]	linear	Nonlinear	continuous	single_level
chebil2015	A dynamic programming algorithm for the Knapsack Problem with Setup	Computers & Operations Research	2,015	max	Knapsack & Selection	planning	BIP	Foundational / Theoretical	10,030	10,030	10,001	https://www.sciencedirect.com/science/article/abs/pii/S0305054815001215	0-1 Knapsack	Knapsack & Selection	[ "Knapsack & Selection::0-1 Knapsack" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
chebil2019	An exact approach for the 0–1 Knapsack Problem with Setups	Computers & Operations Research	2,017	max	Knapsack & Selection	planning	BIP	Foundational / Theoretical	50,100	50,100	50,001	https://doi.org/10.1016/j.cor.2016.11.015	0-1 Knapsack	Knapsack & Selection	[ "Knapsack & Selection::0-1 Knapsack" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
chen1999	Solving Parallel Machine Scheduling Problems by Column Generation	INFORMS Journal on Computing	1,999	min	Scheduling	strategic	MINLP	Manufacturing & Production	101,200	51,600	149,810	https://doi.org/10.1287/ijoc.11.1.78	Parallel-Machine Scheduling	Scheduling	[ "Scheduling::Parallel-Machine Scheduling" ]	[]	[]	general_nonlinear	deterministic	[ "none" ]	quadratic	Nonlinear	mixed_continuous_discrete	single_level
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	Routing	operational	MILP	Transportation & Logistics	1,048,880	1,029,000	2,415,979	https://doi.org/10.1287/trsc.2014.0535	Pickup-and-Delivery Problem	Routing	[ "Routing::Pickup-and-Delivery Problem" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
colombi2017	The directed profitable rural postman problem with incompatibility constraints	European Journal of Operational Research	2,017	max	Routing	operational	IP	Transportation & Logistics	8,453	2,635	8,028	https://doi.org/10.1016/j.ejor.2017.02.002	Arc Routing	Routing	[ "Routing::Arc Routing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Integer linear	integer	single_level
contreras2011	Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment	INFORMS Journal on Computing	2,011	min	Facility Location	planning	MILP	Transportation & Logistics	2,561,600	1,600	131,241	https://doi.org/10.1287/ijoc.1100.0391	Hub Location	Facility Location	[ "Facility Location::Hub Location" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
cordeau2006	A Branch-and-Cut Algorithm for the Dial-a-Ride Problem	Operations Research	2,006	min	Routing	operational	MIQCQP	Public Transit & Mobility	11,456	11,260	4,349	https://doi.org/10.1287/opre.1060.0283	Dial-a-Ride Problem	Routing	[ "Routing::Dial-a-Ride Problem" ]	[]	[]	linear	deterministic	[ "none" ]	quadratic	Quadratic	mixed_continuous_discrete	single_level
cordeau2014	Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem	Transportation Science	2,014	min	Routing	operational	MILP	Transportation & Logistics	41,412	41,412	408	https://doi.org/10.1287/trsc.1120.0449	TSP	Routing	[ "Routing::TSP" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
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	BIP	Public Service & Government	100,100	100	100,001	https://www.sciencedirect.com/science/article/abs/pii/S0377221718310737	Coverage Location	Facility Location	[ "Facility Location::Coverage Location" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
cote2018	The Meet-in-the-Middle Principle for Cutting and Packing Problems	INFORMS Journal on Computing	2,018	min	Packing, Cutting & Loading	planning	MILP	Foundational / Theoretical	67,310	67,310	21,292	https://pubsonline.informs.org/doi/10.1287/ijoc.2018.0806	Cutting Stock	Packing, Cutting & Loading	[ "Packing, Cutting & Loading::Cutting Stock" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
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	Inventory & Lot Sizing	planning	MILP	Supply Chain & Inventory	19,890	6,630	13,260	https://www.sciencedirect.com/science/article/abs/pii/S0377221721002551	Multi-Echelon Inventory	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Multi-Echelon Inventory" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
damcikurt2016	Strong Formulations for the Multistage Stochastic Self-Scheduling Unit Commitment	Operations Research	2,016	max	Scheduling	operational	MINLP	Energy & Power Systems	3,145,724	2,097,149	11,534,314	https://doi.org/10.1287/opre.2016.1520	Unit Commitment	Scheduling	[ "Scheduling::Unit Commitment" ]	[]	[]	general_nonlinear	stochastic	[ "none" ]	general_nonlinear	Nonlinear	mixed_continuous_discrete	single_level
dayarian2019	A Branch-Price-and-Cut Algorithm for a Production-Routing Problem with Short-Life-Span Products	Transportation Science	2,019	min	Routing	operational	MILP	Transportation & Logistics	19,310	16,964	35,831	https://doi.org/10.1287/trsc.2018.0854	VRP with Time Windows	Routing	[ "Routing::VRP with Time Windows", "Scheduling::Personnel Rostering" ]	[ "Scheduling::Personnel Rostering" ]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
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	Inventory & Lot Sizing	planning	MILP	Manufacturing & Production	1,830	600	1,220	https://pubsonline.informs.org/doi/10.1287/opre.1070.0404	Multi-Item Lot Sizing	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Multi-Item Lot Sizing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
delage2022	Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems	INFORMS Journal on Computing	2,022	min	Packing, Cutting & Loading	strategic	MIQCQP	Manufacturing & Production	5,910	2,520	8,400	https://doi.org/10.1287/ijoc.2021.1079	Cutting Stock	Packing, Cutting & Loading	[ "Packing, Cutting & Loading::Cutting Stock" ]	[]	[]	linear	deterministic	[ "none" ]	quadratic	Quadratic	mixed_continuous_discrete	single_level
delorme2020	Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems	INFORMS Journal on Computing	2,019	min	Packing, Cutting & Loading	planning	IP	Foundational / Theoretical	1,641,755	1,641,755	5,467	https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2018.0880	Cutting Stock	Packing, Cutting & Loading	[ "Packing, Cutting & Loading::Cutting Stock" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Integer linear	integer	single_level
desaulniers2010	Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows	Operations Research	2,010	min	Routing	operational	MIQCQP	Transportation & Logistics	98,817	92,289	99,008	https://doi.org/10.1287/opre.1090.0713	VRP with Time Windows	Routing	[ "Routing::VRP with Time Windows" ]	[]	[]	linear	deterministic	[ "none" ]	quadratic	Quadratic	mixed_continuous_discrete	single_level
desaulniers2014	A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem	Les Cahiers du GERAD	2,014	min	Routing	operational	MILP (aggregate integrality)	Supply Chain & Inventory	15,753	7,800	8,709	https://doi.org/10.1287/trsc.2015.0635	Capacitated VRP	Routing	[ "Routing::Capacitated VRP", "Inventory & Lot Sizing::Inventory Control" ]	[ "Inventory & Lot Sizing::Inventory Control" ]	[]	linear	deterministic	[ "aggregate_integrality" ]	linear	Mixed-integer / mixed-discrete linear	continuous	single_level
desaulniers2016	A Branch-Price-and-Cut Algorithm for the Inventory-Routing Problem	Transportation Science	2,016	min	Routing	operational	MILP (aggregate integrality)	Supply Chain & Inventory	33,213	31,725	32,868	https://doi.org/10.1287/trsc.2015.0635	Capacitated VRP	Routing	[ "Routing::Capacitated VRP", "Inventory & Lot Sizing::Inventory Control" ]	[ "Inventory & Lot Sizing::Inventory Control" ]	[]	linear	deterministic	[ "aggregate_integrality" ]	linear	Mixed-integer / mixed-discrete linear	continuous	single_level
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	Assignment & Matching	strategic	MILP	Manufacturing & Production	14,560	7,378	23,714	https://doi.org/10.1016/j.ejor.2023.11.045	Multi-Period Connected Quota Assignment	Assignment & Matching	[ "Assignment & Matching::Multi-Period Connected Quota Assignment" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
lai2021	Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping	European Journal of Operational Research	2,021	max	Clustering & Districting	planning	BQP	Foundational / Theoretical	20,000	20,000	500	https://www.sciencedirect.com/science/article/abs/pii/S0377221720306743	Capacitated Clustering	Clustering & Districting	[ "Clustering & Districting::Capacitated Clustering" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
elci2022	Stochastic Planning and Scheduling with Logic-Based Benders Decomposition	INFORMS Journal on Computing	2,022	min	Scheduling	strategic	CP	Manufacturing & Production	1,525,989	1,525,864	1,617,160	https://doi.org/10.1287/ijoc.2022.1184	Cumulative Resource Scheduling	Scheduling	[ "Scheduling::Cumulative Resource Scheduling" ]	[]	[]	linear	stochastic	[ "none" ]	explicit_CP_global	Cumulative scheduling / CP	mixed_continuous_discrete	single_level
engineer2012	A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing	Operations Research	2,012	min	Routing	operational	MILP (aggregate integrality)	Supply Chain & Inventory	13,456	6,588	14,305	https://doi.org/10.1287/opre.1110.0997	VRP	Routing	[ "Routing::VRP", "Inventory & Lot Sizing::Inventory Control" ]	[ "Inventory & Lot Sizing::Inventory Control" ]	[]	linear	deterministic	[ "aggregate_integrality" ]	linear	Mixed-integer / mixed-discrete linear	continuous	single_level
schwerdfeger2016	A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines	Computers & Operations Research	2,016	min	Scheduling	strategic	MINLP	Manufacturing & Production	3,934	3,920	294	https://doi.org/10.1016/j.cor.2016.03.008	Parallel-Machine Scheduling	Scheduling	[ "Scheduling::Parallel-Machine Scheduling" ]	[]	[]	general_nonlinear	deterministic	[ "none" ]	linear	Nonlinear	mixed_continuous_discrete	single_level
fischetti1997	A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem	Operations Research	1,997	min	Routing	operational	BIP	Transportation & Logistics	96,814	96,814	39,516	https://doi.org/10.1287/opre.45.3.378	Generalized Traveling Salesman Problem	Routing	[ "Routing::Generalized Traveling Salesman Problem" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
fischetti1998	Solving the Orienteering Problem through Branch-and-Cut	INFORMS Journal on Computing	1,998	max	Routing	operational	BIP	Transportation & Logistics	125,250	125,250	249,503	https://doi.org/10.1287/ijoc.10.2.133	Orienteering Problem	Routing	[ "Routing::Orienteering Problem" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
fischetti2017	Redesigning Benders Decomposition for Large-Scale Facility Location	Management Science	2,016	min	Facility Location	planning	MIQP	Transportation & Logistics	933,380	140	469,953	https://pubsonline.informs.org/doi/10.1287/mnsc.2016.2461	Uncapacitated Facility Location	Facility Location	[ "Facility Location::Uncapacitated Facility Location" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	mixed_continuous_discrete	single_level
fleszar2022b	A branch-and-bound algorithm for the quadratic multiple knapsack problem	European Journal of Operational Research	2,022	max	Knapsack & Selection	planning	BQP	Foundational / Theoretical	600	600	70	https://www.sciencedirect.com/science/article/abs/pii/S0377221721005336	Quadratic Knapsack	Knapsack & Selection	[ "Knapsack & Selection::Quadratic Knapsack" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
samarghandi2017	On the exact solution of the no-wait flow shop problem with due date constraints	Computers & Operations Research	2,017	min	Scheduling	operational	MILP	Manufacturing & Production	601	400	4,271	https://doi.org/10.1016/j.cor.2016.12.013	Flow-Shop Scheduling	Scheduling	[ "Scheduling::Flow-Shop Scheduling" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
forrest2006	A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints	INFORMS Journal on Computing	2,006	max	Knapsack & Selection	strategic	BQP	Manufacturing & Production	82,355	82,355	75,237	https://doi.org/10.1287/ijoc.1040.0078	Multiple Knapsack	Knapsack & Selection	[ "Knapsack & Selection::Multiple Knapsack" ]	[]	[]	quadratic	deterministic	[ "none" ]	linear	Quadratic	binary	single_level
fragkos2016	A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times	INFORMS Journal on Computing	2,016	min	Inventory & Lot Sizing	strategic	MILP	Manufacturing & Production	3,010	1,000	2,110	https://doi.org/10.1287/ijoc.2016.0691	Multi-Item Lot Sizing	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Multi-Item Lot Sizing" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
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	BNLP	Transportation & Logistics	10,001	10,000	0	https://doi.org/10.1287/ijoc.2021.1063	Uncapacitated Facility Location	Facility Location	[ "Facility Location::Uncapacitated Facility Location" ]	[]	[]	general_nonlinear	distributionally_robust	[ "none" ]	linear	Nonlinear	binary	single_level
eiselt2009	A conditional p-hub location problem with attraction functions	Computers & Operations Research	2,009	max	Facility Location	planning	BNLP	Aerospace & Aviation	195,925	325	586,201	https://doi.org/10.1016/j.cor.2008.11.014	Hub Location	Facility Location	[ "Facility Location::Hub Location" ]	[]	[]	general_nonlinear	deterministic	[ "none" ]	linear	Nonlinear	binary	single_level
freeman2018	Attractive Orienteering Problem with Proximity and Timing Interactions	European Journal of Operational Research	2,018	max	Routing	strategic	MIQCQP	Sports & Entertainment	234,930	1,710	692,599	https://doi.org/10.1016/j.ejor.2017.09.025	Orienteering Problem	Routing	[ "Routing::Orienteering Problem", "Scheduling::Event Scheduling" ]	[ "Scheduling::Event Scheduling" ]	[]	linear	deterministic	[ "none" ]	quadratic	Quadratic	mixed_continuous_discrete	single_level
freling2003	A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem	Operations Research	2,003	min	Inventory & Lot Sizing	strategic	MILP	Manufacturing & Production	1,974	1,890	219	https://doi.org/10.1287/opre.51.6.922.24914	Production-Inventory Planning	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Production-Inventory Planning" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
frey2017	Column Generation for Outbound Baggage Handling at Airports	Transportation Science	2,017	min	Scheduling	operational	BIP	Aerospace & Aviation	1,205,240	1,156,189	62,996	https://doi.org/10.1287/trsc.2017.0739	Cumulative Resource Scheduling	Scheduling	[ "Scheduling::Cumulative Resource Scheduling" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
furini2016	Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming	INFORMS Journal on Computing	2,016	max	Knapsack & Selection	operational	IP	Manufacturing & Production	3,281,559	3,281,559	37,797	https://doi.org/10.1287/ijoc.2016.0710	Two-Dimensional Guillotine Knapsack	Knapsack & Selection	[ "Knapsack & Selection::Two-Dimensional Guillotine Knapsack" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Integer linear	integer	single_level
furini2017	An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem	Networks	2,017	min	Graph Optimization	planning	Combinatorial (non-algebraic)	Foundational / Theoretical	1,029	1,029	14,465	https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21716	Graph Coloring	Graph Optimization	[ "Graph Optimization::Graph Coloring" ]	[]	[]	non_algebraic	deterministic	[ "none" ]	non_algebraic	Combinatorial	non_algebraic	single_level
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	Maximum Clique	Graph Optimization	[ "Graph Optimization::Maximum Clique" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
furini2021	A branch-and-cut algorithm for the Edge Interdiction Clique Problem	European Journal of Operational Research	2,021	min	Graph Optimization	planning	MILP	Foundational / Theoretical	2,543	2,543	2	https://www.sciencedirect.com/science/article/abs/pii/S0377221721000606	Clique Interdiction	Graph Optimization	[ "Graph Optimization::Clique Interdiction" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	bilevel
gamache1999	A Column Generation Approach for Large-Scale Aircrew Rostering Problems	Operations Research	1,999	min	Scheduling	strategic	MILP	Aerospace & Aviation	228,907	228,875	82	https://doi.org/10.1287/opre.47.2.247	Personnel Rostering	Scheduling	[ "Scheduling::Personnel Rostering" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
garcia2011	Solving Large p-Median Problems with a Radius Formulation	INFORMS Journal on Computing	2,011	min	Facility Location	planning	MILP	Foundational / Theoretical	88,397	300	88,098	https://pubsonline.informs.org/doi/10.1287/ijoc.1100.0418	p-Median	Facility Location	[ "Facility Location::p-Median" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
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	Inventory & Lot Sizing	planning	MILP	Supply Chain & Inventory	4,825,320	1,320	4,824,088	https://doi.org/10.1016/j.ejor.2020.09.019	Multi-Echelon Inventory	Inventory & Lot Sizing	[ "Inventory & Lot Sizing::Multi-Echelon Inventory" ]	[]	[]	linear	stochastic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
gschwind2021	A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques	INFORMS Journal on Computing	2,021	min	Graph Optimization	operational	BIP	Foundational / Theoretical	500	0	500	https://doi.org/10.1287/ijoc.2020.0984	Relaxed-Clique Decomposition	Graph Optimization	[ "Graph Optimization::Relaxed-Clique Decomposition" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
gualandi2012	Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation	INFORMS Journal on Computing	2,012	min	Graph Optimization	planning	Mixed-discrete disjunctive program	Foundational / Theoretical	10,251	10,251	634,540	https://pubsonline.informs.org/doi/10.1287/ijoc.1100.0436	Graph Coloring	Graph Optimization	[ "Graph Optimization::Graph Coloring" ]	[]	[]	linear	deterministic	[ "finite_domain_disjunction", "nonlinear_logical" ]	explicit_CP_global	Disjunctive	integer	single_level
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	operational	BIP	Healthcare	568,286	568,286	575,895	https://pubsonline.informs.org/doi/10.1287/ijoc.2020.1036	Parallel-Machine Scheduling	Scheduling	[ "Scheduling::Parallel-Machine Scheduling" ]	[]	[]	linear	stochastic	[ "none" ]	linear	Binary linear	binary	single_level
hadjar2006	A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem	Operations Research	2,006	min	Scheduling	operational	BIP	Public Transit & Mobility	780,210	780,210	4,212	https://doi.org/10.1287/opre.1050.0240	Vehicle Scheduling	Scheduling	[ "Scheduling::Vehicle Scheduling" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Binary linear	binary	single_level
hewitt2024	Production planning under demand and endogenous supply uncertainty	arXiv preprint	2,025	max	Resource Allocation & Blending	strategic	MIQP	Manufacturing & Production	307,640	2,590	551,595	https://doi.org/10.1287/ijoc.2023.0067	Production Mix	Resource Allocation & Blending	[ "Resource Allocation & Blending::Production Mix" ]	[]	[]	quadratic	stochastic	[ "none" ]	linear	Quadratic	mixed_continuous_discrete	single_level
hoffman1993	Solving Airline Crew Scheduling Problems by Branch-and-Cut	Management Science	1,993	min	Scheduling	strategic	BIP	Aerospace & Aviation	15,000	15,000	100	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	2,020	max	Graph Optimization	planning	BIP	Foundational / Theoretical	40,300	40,300	119,700	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	2,005	min	Scheduling	operational	BIP	Public Transit & Mobility	287,214	287,214	1,512	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	2,019	min	Scheduling	strategic	MIQP	Transportation & Logistics	3,738	2,274	7,261	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	2,023	min	Scheduling	operational	MIQCQP	Manufacturing & Production	39,828	39,827	111,343	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	2,021	min	Routing	operational	MILP	Transportation & Logistics	7,654	7,551	2,809	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	2,005	min	Facility Location	planning	MILP	Transportation & Logistics	1,125,750	750	1,127,251	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
knueven2020	On Mixed Integer Programming Formulations for the Unit Commitment Problem	INFORMS Journal on Computing	2,020	min	Scheduling	operational	MILP	Energy & Power Systems	450,144	129,600	623,040	https://doi.org/10.1287/ijoc.2019.0944	Unit Commitment	Scheduling	[ "Scheduling::Unit Commitment" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Mixed-integer / mixed-discrete linear	mixed_continuous_discrete	single_level
kobayashi2021	Bilevel Cutting-plane Algorithm for Solving Cardinality-constrained Mean-CVaR Portfolio Optimization Problems	Journal of Global Optimization	2,021	min	Knapsack & Selection	strategic	MINLP (linear indicators)	Finance & Investment	10,452	225	10,229	https://doi.org/10.1007/s10898-021-01048-5	Portfolio Selection	Knapsack & Selection	[ "Knapsack & Selection::Portfolio Selection" ]	[]	[]	quadratic	stochastic	[ "linear_indicator" ]	general_nonlinear	Nonlinear	mixed_continuous_discrete	single_level
kobeaga2024	A revisited branch-and-cut algorithm for large-scale orienteering problems	European Journal of Operational Research	2,024	max	Routing	operational	MILP	Foundational / Theoretical	45,150	45,150	90,002	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	2,018	min	Scheduling	strategic	BIP	Manufacturing & Production	284,784	284,784	31	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	2,024	min	Scheduling	strategic	BIP	Manufacturing & Production	130,970	65,485	65,536	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	2,019	min	Scheduling	strategic	MILP	Transportation & Logistics	47,600	47,029	65,965	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	2,018	min	Scheduling	planning	Combinatorial (non-algebraic)	Manufacturing & Production	52,059	52,055	110,513	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	2,003	min	Routing	operational	MILP	Transportation & Logistics	10,091	5,050	5,440	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	1,996	min	Network Design	planning	MILP	Telecommunications & Networking	12,985	70	15,621	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
legrain2020	A rotation-based branch-and-price approach for the nurse scheduling problem	Mathematical Programming Computation	2,020	min	Scheduling	strategic	IP	Healthcare	176,408	104,672	183,512	https://link.springer.com/article/10.1007/s12532-019-00172-4	Personnel Rostering	Scheduling	[ "Scheduling::Personnel Rostering" ]	[]	[]	linear	deterministic	[ "none" ]	linear	Integer linear	integer	single_level

End of preview. Expand in Data Studio

FrontierOR Benchmark

A benchmark of 180 literature-grounded OR tasks, each packaged as a self-contained reproducible unit: natural-language problem description, mathematical formulation, reference Gurobi implementation, test instances, reference solutions, and an automated feasibility checker.

Designed for evaluating LLMs on the end-to-end task of turning a research paper's OR problem into runnable, verifiably-correct optimization code.

🎯 FrontierOR-v1 is released!

FrontierOR-v1 was updated on 2026-09-27. This important dataset update consolidates the canonical 180-task collection, Gurobi references, hard-set split metadata, feasibility checkers, and task-instance artifacts. For detailed fixes and compatibility notes, see RELEASE_NOTES.md.

Layout

Path	Purpose
`README.md`	Dataset overview and loading instructions
`RELEASE_NOTES.md`	Detailed FrontierOR-v1 update notes
`CASE_IDS.txt`	Canonical task id list
`LICENSE.md`	Dataset license
`metadata/`	Paper metadata, Gurobi reference summaries, and benchmark split metadata
`metadata/paper_meta_info.json`	Metadata for all 180 canonical papers, including optimization direction
`metadata/gurobi_references.parquet` / `.csv.gz`	Canonical Gurobi objectives, runtimes, statuses, and related reference fields
`metadata/hardset/`	Hard-set ids, ranking inputs, methodology, and reproduction script
`tasks/<task_id>/`	Self-contained task package for one paper

What's in each task folder

File / dir	Purpose
`problem_description.txt`	Natural-language problem statement
`mathematical_formulation.md`	Mathematical model (variables, constraints, objective)
`gurobi_code.py`	Reference Gurobi implementation
`feasibility_check.py`	Automated solution validator
`solution_logger.py`	Utility for serializing solutions
`instance_schema.json`	JSON schema for input instances
`solution_schema.json`	JSON schema for solutions
`instance/`	Six benchmark instances: `tiny_instance.json` and `large_instance_1.json` through `large_instance_5.json`
`gurobi_solution/`	Reference Gurobi solutions for the tiny and five large instances
`gurobi_solution_log/`	Anytime incumbent objective trajectories from the reference Gurobi runs
`gurobi_feasi_result/`	Feasibility-check outputs for the reference Gurobi solutions
`solverless_models/`	Optional task-local assets for checkers that need solver-independent validation models

Loading the metadata

from datasets import load_dataset
meta = load_dataset("frontieror/FrontierOR", "meta", split="train")
print(meta[0])

For the per-paper instance / solution data, clone or download the full repository — the structure is intentionally a file tree, not a flat HF dataset, because each paper is its own reproducible package under tasks/<task_id>/.

hf download frontieror/FrontierOR --repo-type dataset --local-dir frontier-or

To update an existing local copy without downloading everything from scratch, rerun the same command; unchanged files are reused from the Hugging Face cache and only missing or changed files are fetched.

hf download frontieror/FrontierOR --repo-type dataset --local-dir frontier-or

If your local copy was created by git clone, update it with:

cd frontier-or
git pull
git lfs pull

When upgrading from an older snapshot, note that files deleted upstream may remain in an existing --local-dir checkout. Remove stale top-level files manually if present, or refresh from a clean directory when exact directory parity is required.

Downloads last month: 9,161

Paper for frontieror/FrontierOR

FrontierOR: Benchmarking LLMs' Capacity for Efficient Algorithm Design in Large-Scale Optimization

Paper • 2605.25246 • Published May 30