tbfp-bigm

variable_bound set_partitioning

Submitter	Variables	Constraints	Density	Status	Group	Objective	MPS File
Rob Pratt	2406	35999	8.58272e-04	hard	–	24.163194443	tbfp-bigm.mps.gz

Two formulations (big-M and network-based) for traveling baseball fan problem. Uses data from 2014 Major League Baseball regular season. Paper uses 2014 data: https://support.sas.com/resources/papers/proceedings14/SAS101-2014.pdf Blog post uses 2015 data: https://blogs.sas.com/content/operations/2015/04/03/the-traveling-baseball-fan-problem/

Location of instance in collection

Instance Statistics

Detailed explanation of the following tables can be found here.

Size Related Properties
	Original	Presolved
Variables	2406	2406
Constraints	35999	35995
Binaries	2404	2404
Integers	0	0
Continuous	2	2
Implicit Integers	0	0
Fixed Variables	0	0
Nonzero Density	0.000858272	0.000858321
Nonzeroes	74338	74334

Constraint Classification Properties
	Original	Presolved
Total	35999	35995
Empty	0	0
Free	0	0
Singleton	4	0
Aggregations	0	0
Precedence	0	0
Variable Bound	35965	35965
Set Partitioning	30	30
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	0	0
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.491362
Constraint %		0.00278	0.00278	0.00278	0.00278
Variable %		3.15877	3.33056	3.36658	3.36658
Score	0.000806

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	24.16319	24.16319	0	0	0	Rob Pratt	2018-11-09	Obtained by transforming an optimal solution of the related instance tbfp_network
1	25.22917	25.22917	0	0	0	-	2018-10-11	Solution found during MIPLIB2017 problem selection.

Similar instances in collection

The following instances are most similar to tbfp-bigm 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
neos-5041756-cobark	easy	60301	60000	0	301	30900	180900	Jeff Linderoth	neos-pseudoapplication-12	Unbounded	decomposition precedence variable_bound set_packing invariant_knapsack mixed_binary
pw-myciel4	easy	1059	1058	1	0	8164	17779	Arie Koster	–	9.999999999999996	benchmark_suitable precedence variable_bound set_partitioning general_linear
ns1760995	easy	17956	17822	0	134	615388	1854012	NEOS Server Submission	neos-pseudoapplication-12	-549.21438505	benchmark benchmark_suitable precedence variable_bound set_partitioning set_packing cardinality mixed_binary
neos-1171448	easy	4914	2457	0	2457	13206	131859	NEOS Server Submission	neos-pseudoapplication-8	-309	benchmark benchmark_suitable variable_bound invariant_knapsack mixed_binary
graphdraw-domain	easy	254	180	20	54	865	2600	Cézar Augusto Nascimento e Silva	graphdraw	19685.99997550038	benchmark benchmark_suitable variable_bound set_partitioning invariant_knapsack mixed_binary general_linear

Reference

@INPROCEEDINGS{ChapmanGalatiPratt2014,
  author = {Tonya Chapman and Matt Galati and Rob Pratt},
  title = {The Traveling Baseball Fan Problem and the OPTMODEL Procedure},
  booktitle = {Proceedings of the SAS Global Forum 2014 Conference},
  year = {2014},
  address = {Cary, NC},
  publisher = {SAS Institute Inc.},
  note = {\url{http://support.sas.com/resources/papers/proceedings14/SAS101-2014.pdf}}
}