usafa

aggregations precedence variable_bound set_partitioning set_packing invariant_knapsack binpacking integer_knapsack general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Christopher Daniel Richards	228648	1377561	5.23376e-05	easy	–	160.1671356761785	usafa.mps.gz

Population Complete Timetabling Problem for the United States Air Force Academy

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	228648	228645
Constraints	1377561	1377560
Binaries	216357	216357
Integers	12291	12288
Continuous	0	0
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	5.23376e-05	5.23383e-05
Nonzeroes	16485100	16485100

Constraint Classification Properties
	Original	Presolved
Total	1377561	1377560
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	15	15
Precedence	4097	4096
Variable Bound	6553	6553
Set Partitioning	15691	15691
Set Packing	71760	71760
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	520093	520093
Equation Knapsack	0	0
Bin Packing	750792	750792
Knapsack	0	0
Integer Knapsack	407	407
Mixed Binary	0	0
General Linear	8153	8153
Indicator	0	0

Structure

Available nonzero structure and decomposition information. Further information can be found here.

Nonzero entries of original problem

Nonzero entries after trivial presolving

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

	value	min	median	mean	max
Components
Constraint %
Variable %
Score

Best Known Solution(s)

Find solutions below. Download the archive containing all solutions from the Download page.

ID	Objective	Exact	Int. Viol	Cons. Viol	Obj. Viol	Submitter	Date	Description
2	160.1671	160.1671	5e-07	0	0	Michael Winkler	2024-07-16	Gurobi 11.0.1 on AMD EPYC 7313P 16-Core Processor with 264075352 kB memory
1	160.1671	160.1671	0e+00	0	0	-	2018-10-11	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to usafa in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

Instance	Status	Variables	Binaries	Integers	Continuous	Constraints	Nonz.	Submitter	Group	Objective	Tags
fhnw-binschedule1	open	1141653	1137008	4644	1	772872	8611326	Simon Felix	fhnw-bin	55198.0*	variable_bound set_partitioning set_packing invariant_knapsack binpacking mixed_binary general_linear
neos8	easy	23228	23224	4	0	46324	313180	NEOS Server Submission	neos-pseudoapplication-15	-3719	benchmark benchmark_suitable precedence set_packing cardinality invariant_knapsack binpacking general_linear
fhnw-binschedule0	open	319319	316270	3048	1	58085	1382972	Simon Felix	fhnw-bin	16088.0*	decomposition variable_bound set_partitioning set_packing invariant_knapsack binpacking mixed_binary general_linear
hypothyroid-k1	easy	2602	2601	1	0	5195	433884	Gleb Belov	hypothyroid	-2851	benchmark benchmark_suitable aggregations precedence set_covering binpacking general_linear
fhnw-binschedule2	open	30973	30504	468	1	6503	134640	Simon Felix	fhnw-bin	2428*	decomposition variable_bound set_partitioning set_packing invariant_knapsack binpacking mixed_binary general_linear

Reference

@article{USAFA_Sched,
author = {Gonzalez, Gerrado and Richards, Christopher and Newman, Alexandra},
title = {Optimal Course Scheduling for United States Air Force Academy Cadets},
journal = {Interfaces},
volume = {48},
issue = {3},
pages = {217--234},
year = {2018},
url = {https://pubsonline.informs.org/doi/abs/10.1287/inte.2017.0935}
}