Parametric Integer Programming:  The Right-Hand-Side-Case

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5143

Full metadata record

DC Field	Value	Language
dc.creator	Marsten, Roy E.	-
dc.creator	Morin, Thomas L.	-
dc.date	2004-05-28T19:25:05Z	-
dc.date	2004-05-28T19:25:05Z	-
dc.date	1976-03	-
dc.date.accessioned	2013-10-09T02:37:58Z	-
dc.date.available	2013-10-09T02:37:58Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5143	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	A family of integer programs is considered whose right-hand-sides lie on a given line segment L. This family is called a parametric integer program(PIP). Solving a (PIP) means finding an optimal solution for every program in the family. It is shown how a simple generalization of the conventional branch-and-bound approach to integer programming makes it possible to solve such a (PIP). The usual bounding test is extended from a comparison of two point values to a comparison of two functions defined on the line segment L. The method is illustrated on a small example and computational results for some larger problems are reported.	-
dc.description	Supported in part by the U.S. Army Research Office (Durham) under Contract DAHC04-73-C-0032.	-
dc.format	1746 bytes	-
dc.format	1188371 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 050-76	-
dc.title	Parametric Integer Programming: The Right-Hand-Side-Case	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI