triptim8

aggregations variable_bound set_partitioning set_packing set_covering invariant_knapsack mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
MIPLIB submission pool	27342	14427	1.32318e-03	hard	triptim	2566.065999999642	triptim8.mps.gz

Trip timetable optimization problem. Imported from the MIPLIB2010 submissions.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	27342	24260
Constraints	14427	14414
Binaries	18619	15560
Integers	8716	8698
Continuous	7	2
Implicit Integers	0	0
Fixed Variables	8	0
Nonzero Density	0.00132318	0.00145745
Nonzeroes	521945	509647

Constraint Classification Properties
	Original	Presolved
Total	14427	14414
Empty	0	0
Free	0	0
Singleton	3	0
Aggregations	14	11
Precedence	1	0
Variable Bound	6	3
Set Partitioning	0	16
Set Packing	1898	1898
Set Covering	3784	1890
Cardinality	0	0
Invariant Knapsack	5	1897
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	2	2
General Linear	8714	8697
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	1.146128
Constraint %		0.00694	3.04245	0.00694	20.2373
Variable %		0.00824	3.24960	0.00824	19.6694
Score	0.319660

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	2566.066	2566.066	0	0	0	Hans Mittelmann	2021-12-05	Solved with Gurobi 9.5.0rc5 using 96 threads in 18 hours.
1	2566.069	2566.069	0	0	0	-	2018-10-13	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to triptim8 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
triptim7	easy	27342	18619	8716	7	14427	521944	MIPLIB submission pool	triptim	2566.02	aggregations variable_bound set_partitioning set_packing set_covering invariant_knapsack mixed_binary general_linear
triptim4	hard	27226	18537	8682	7	14361	520532	MIPLIB submission pool	triptim	9.818099999800323	aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear
triptim1	easy	30055	20456	9592	7	15706	515436	MIPLIB submission pool	triptim	22.8680999999999	benchmark benchmark_suitable aggregations precedence variable_bound set_partitioning set_packing set_covering invariant_knapsack general_linear
triptim2	hard	27326	20776	6543	7	14427	521898	MIPLIB submission pool	triptim	12.0051	aggregations precedence variable_bound set_partitioning set_packing set_covering cardinality invariant_knapsack general_linear
supportcase34	easy	17879	11196	6682	1	15170	748887	Domenico Salvagnin	–	83.99999985999999	benchmark_suitable aggregations precedence variable_bound set_partitioning cardinality invariant_knapsack knapsack integer_knapsack mixed_binary general_linear

Reference

No bibliographic information available