biella1

benchmark_suitable mixed_binary general_linear

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Double-Click SAS	7328	1203	8.10939e-03	easy	–	3065005.78	biella1.mps.gz

Crew scheduling instance Imported from MIPLIB2010.

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	7328	7311
Constraints	1203	1202
Binaries	6110	6110
Integers	0	1197
Continuous	1218	4
Implicit Integers	0	1197
Fixed Variables	0	0
Nonzero Density	0.00810939	0.00811737
Nonzeroes	71489	71334

Constraint Classification Properties
	Original	Presolved
Total	1203	1202
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	0	0
Precedence	0	0
Variable Bound	0	0
Set Partitioning	0	0
Set Packing	0	0
Set Covering	0	0
Cardinality	0	0
Invariant Knapsack	0	0
Equation Knapsack	0	0
Bin Packing	0	0
Knapsack	0	0
Integer Knapsack	0	0
Mixed Binary	1203	4
General Linear	0	1198
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	0.301030
Constraint %		0.332779	0.332779	0.332779	0.332779
Variable %		83.340200	83.340200	83.340200	83.340200
Score	0.000554

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	3065006	3065006	0	0	0	-	2018-10-13	Solution found during MIPLIB2017 problem selection.
1	3065006	3065006	0	0	0	-	2018-10-13	Solution imported from MIPLIB2010.

Similar instances in collection

The following instances are most similar to biella1 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	Continuous	Constraints	Nonz.	Submitter	Group	Objective	Tags
trento1	easy	7687	6415	1272	1265	93571	MIPLIB submission pool	–	5189487	benchmark benchmark_suitable mixed_binary general_linear
dolom1	hard	11612	9720	1892	1803	190413	Double-Click SAS	–	6609253	mixed_binary general_linear
dc1c	hard	10039	8380	1659	1649	121158	Double-Click SAS	–	1767903.6501	mixed_binary general_linear
nsr8k	open	38356	32040	6316	6284	371608	MIPLIB submission pool	–	17974887.99753601*	mixed_binary general_linear
dc1l	open	37297	35638	1659	1653	448754	Double-Click SAS	–	1758647.6801*	mixed_binary general_linear

Reference

@article{FischettiGloverLodi2005,
 author = {M. Fischetti and F. Glover and A. Lodi},
 journal = {Mathematical Programming},
 pages = {91--104},
 title = {The feasibility pump},
 volume = {104},
 year = {2005}
}

@article{FischettiLodi2003,
 author = {Fischetti, Matteo and Lodi, Andrea},
 issn = {0025-5610},
 issue = {1},
 journal = {Mathematical Programming},
 keyword = {Mathematics and Statistics},
 pages = {23-47},
 publisher = {Springer},
 title = {Local branching},
 volume = {98},
 year = {2003}
}