Please use this identifier to cite or link to this item: https://repository.iimb.ac.in/handle/123456789/619
DC FieldValueLanguage
dc.contributor.authorRao, Mendu Rammohanen_US
dc.contributor.authorChandru, Ven_US
dc.date.accessioned2012-07-26T11:27:41Z
dc.date.accessioned2016-01-01T07:10:55Z
dc.date.accessioned2019-05-27T08:41:03Z-
dc.date.available2012-07-26T11:27:41Z
dc.date.available2016-01-01T07:10:55Z
dc.date.available2019-05-27T08:41:03Z-
dc.date.copyright1998en_US
dc.date.issued1998
dc.identifier.otherWP_IIMB_110-
dc.identifier.urihttp://repository.iimb.ac.in/handle/123456789/619-
dc.description.abstractInteger programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture the feasible set of alternatives, and linear objective functions (to minimize or maximize over the feasible set) that specify the criterion for defining optimality. This algebraic approach permits certain natural extensions of the powerful methodologies of linear programming to be brought to bear on combinatorial optimization and on fundamental algorithmic questions in the geometry of numbers.
dc.language.isoenen_US
dc.publisherIndian Institute of Management Bangalore-
dc.relation.ispartofseriesIIMB Working Paper-110-
dc.subjectInteger programming-
dc.subjectLinear programming-
dc.subjectOptimization-
dc.subjectGeometry of numbers-
dc.titleInteger programmingen_US
dc.typeWorking Paper
dc.pages62p.
dc.identifier.accessionE16937
Appears in Collections:1998
Files in This Item:
File Description SizeFormat 
WP.IIMB.110.pdf6.14 MBAdobe PDFView/Open
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.