Construction of Plant Location Test Problems with Known Optimal Solutions

Simple item page
dc.contributor.authorFleisher, Jayen_US
dc.date.accessioned2012-03-15T16:25:57Z
dc.date.available2012-03-15T16:25:57Z
dc.date.created1975en_US
dc.date.issued1975en
dc.description.abstractThis report presents a procedure for the construction of plant location problem with known optimal solutions. Plant location problems can be formulated as mixed integer programming problems and thus provide a source of problems for testing integer programming codes. The data comprising these problems will be selected in such a manner that sufficient optimality conditions will be satisfied. Computational results are given to show that this procedure can efficiently generate difficult test problems of this type.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR263en
dc.identifier.urihttp://digital.library.wisc.edu/1793/57968
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleConstruction of Plant Location Test Problems with Known Optimal Solutionsen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR263.pdf
Size:
2.37 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports