000755249 000__ 02569cam\a2200433Ii\4500
000755249 001__ 755249
000755249 005__ 20230306141839.0
000755249 006__ m\\\\\o\\d\\\\\\\\
000755249 007__ cr\cn\nnnunnun
000755249 008__ 160511s2016\\\\sz\a\\\\ob\\\\001\0\eng\d
000755249 020__ $$a9783319240015$$q(electronic book)
000755249 020__ $$a3319240013$$q(electronic book)
000755249 020__ $$z9783319239996
000755249 0247_ $$a10.1007/978-3-319-24001-5$$2doi
000755249 035__ $$aSP(OCoLC)ocn949358357
000755249 035__ $$aSP(OCoLC)949358357
000755249 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dYDXCP$$dOCLCF$$dUPM$$dVT2
000755249 049__ $$aISEA
000755249 050_4 $$aT57.74
000755249 08204 $$a519.7/2$$223
000755249 1001_ $$aHu, T. C.$$q(Te Chiang),$$d1930-$$eauthor.
000755249 24510 $$aLinear and integer programming made easy$$h[electronic resource] /$$cT. C. Hu, Andrew B. Kahng.
000755249 264_1 $$aSwitzerland :$$bSpringer,$$c2016.
000755249 300__ $$a1 online resource (x, 143 pages) :$$billustrations.
000755249 336__ $$atext$$btxt$$2rdacontent
000755249 337__ $$acomputer$$bc$$2rdamedia
000755249 338__ $$aonline resource$$bcr$$2rdacarrier
000755249 504__ $$aIncludes bibliographical references and index.
000755249 5050_ $$aPreliminaries -- Introduction -- Dimension of the Solution Space -- Introduction to the Simplex Method -- Duality and Complementary Slackness -- Revised Simplex Method -- Column Generating Technique -- The Knapsack Problem -- Asymptotic Algorithms -- The World Map on Integer Programs -- Linear and Integer Programming in Practice -- The Branch and Bound Method of Integer Programming.-.
000755249 506__ $$aAccess limited to authorized users.
000755249 5208_ $$aAnnotation$$bThis textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology. The authors' approach is accessible to students from almost all fields of engineering, including operations research, statistics, machine learning, control system design, scheduling, formal verification and computer vision. The presentations enables the basis for numerous approaches to solving hard combinatorial optimization problems through randomization and approximation.
000755249 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed May 11, 2016).
000755249 650_0 $$aLinear programming.
000755249 650_0 $$aInteger programming.
000755249 7001_ $$aKahng, Andrew B.,$$d1963-$$eauthor.
000755249 852__ $$bebk
000755249 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-24001-5$$zOnline Access$$91397441.1
000755249 909CO $$ooai:library.usi.edu:755249$$pGLOBAL_SET
000755249 980__ $$aEBOOK
000755249 980__ $$aBIB
000755249 982__ $$aEbook
000755249 983__ $$aOnline
000755249 994__ $$a92$$bISE