a1c1s1

benchmark_suitable aggregations variable_bound mixed_binary

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
M. Vyve, Y. Pochet	3648	3312	8.42398e-04	easy	c1s1	11503.444125	a1c1s1.mps.gz

Lot sizing instance. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B. 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	3648	3648
Constraints	3312	3312
Binaries	192	192
Integers	0	0
Continuous	3456	3456
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000842398	0.000842398
Nonzeroes	10178	10178

Constraint Classification Properties
	Original	Presolved
Total	3312	3312
Empty	0	0
Free	0	0
Singleton	0	0
Aggregations	6	6
Precedence	0	0
Variable Bound	1968	1968
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	1338	1338
General Linear	0	0
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.792392
Constraint %		0.0301932	1.10478	1.47947	16.2138
Variable %		0.3289470	1.15401	1.34320	14.8849
Score	0.642879

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
1	11503.44	997.5296	0	0	0	-	2018-10-13	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to a1c1s1 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
a2c1s1	easy	3648	192	3456	3312	10178	M. Vyve, Y. Pochet	c1s1	10889.137625	benchmark_suitable aggregations variable_bound mixed_binary
b1c1s1	easy	3872	288	3584	3904	11408	M. Vyve, Y. Pochet	c1s1	24544.25	benchmark benchmark_suitable aggregations variable_bound mixed_binary
b2c1s1	easy	3872	288	3584	3904	11408	M. Vyve, Y. Pochet	c1s1	25687.9	aggregations variable_bound mixed_binary
unitcal_7	easy	25755	2856	22899	48939	127595	R. O’Neill	–	19635558.244	benchmark benchmark_suitable precedence variable_bound mixed_binary general_linear
exp-1-500-5-5	easy	990	250	740	550	1980	MIPLIB submission pool	exp_and_fc	65887	benchmark benchmark_suitable variable_bound set_packing mixed_binary

Reference

@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}
}

@article{PochetVyve2004,
 author = {Y. Pochet and M. Van Vyve},
 instance = {a1c1s1,tr12-30},
 journal = {INFORMS Journal on Computing},
 language = {English},
 number = {3},
 title = {A General Heuristic for Production Planning Problems},
 volume = {16},
 year = {2004}
}