Relaxation methods for pure and mixed integer programming problems

Bibliographic Details
Main Authors: Gorry, George Anthony, Shapiro, Jeremy F., Wolsey, Laurence A.
Format: Working Paper
Published: [Cambridge, M.I.T.] 2009
Subjects:
Online Access:http://hdl.handle.net/1721.1/48932
_version_ 1826193822316494848
author Gorry, George Anthony
Shapiro, Jeremy F.
Wolsey, Laurence A.
author_facet Gorry, George Anthony
Shapiro, Jeremy F.
Wolsey, Laurence A.
author_sort Gorry, George Anthony
collection MIT
first_indexed 2024-09-23T09:45:56Z
format Working Paper
id mit-1721.1/48932
institution Massachusetts Institute of Technology
last_indexed 2024-09-23T09:45:56Z
publishDate 2009
publisher [Cambridge, M.I.T.]
record_format dspace
spelling mit-1721.1/489322019-04-10T09:49:24Z Relaxation methods for pure and mixed integer programming problems Gorry, George Anthony Shapiro, Jeremy F. Wolsey, Laurence A. Integer programming. 2009-10-05T06:49:08Z 2009-10-05T06:49:08Z 1970 Working Paper relaxationmethod00gorr http://hdl.handle.net/1721.1/48932 14409699 000259337 Working paper (Sloan School of Management) ; 456-70. application/pdf [Cambridge, M.I.T.]
spellingShingle Integer programming.
Gorry, George Anthony
Shapiro, Jeremy F.
Wolsey, Laurence A.
Relaxation methods for pure and mixed integer programming problems
title Relaxation methods for pure and mixed integer programming problems
title_full Relaxation methods for pure and mixed integer programming problems
title_fullStr Relaxation methods for pure and mixed integer programming problems
title_full_unstemmed Relaxation methods for pure and mixed integer programming problems
title_short Relaxation methods for pure and mixed integer programming problems
title_sort relaxation methods for pure and mixed integer programming problems
topic Integer programming.
url http://hdl.handle.net/1721.1/48932
work_keys_str_mv AT gorrygeorgeanthony relaxationmethodsforpureandmixedintegerprogrammingproblems
AT shapirojeremyf relaxationmethodsforpureandmixedintegerprogrammingproblems
AT wolseylaurencea relaxationmethodsforpureandmixedintegerprogrammingproblems