MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
  • DSpace@MIT Home
  • Sloan School of Management
  • Sloan Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A group theoretic branch and bound algorithm for the zero-one integer programming problem,

Author(s)
Shapiro, Jeremy F.
Thumbnail
Downloadgrouptheoreticbr00shap.pdf (2.229Mb)
Metadata
Show full item record
Date issued
1967
URI
http://hdl.handle.net/1721.1/48028
Publisher
[Cambridge, Mass., M.I.T.]
Other identifiers
grouptheoreticbr00shap
Series/Report no.
Working paper (Sloan School of Management) ; 302-67.
Keywords
Branch and bound algorithms., Integer programming.

Collections
  • Sloan Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.