Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Integer programming: enumeration - complete and implicit

Integer programming: enumeration - complete and implicit Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values such as 0, 1, 2, 3, or 4. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

Integer programming: enumeration - complete and implicit

ACM SIGMAP Bulletin , Volume (12) – Jun 1, 1972

Loading next page...
 
/lp/association-for-computing-machinery/integer-programming-enumeration-complete-and-implicit-RlheUJB2vN

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1972 by ACM Inc.
ISSN
0163-5786
DOI
10.1145/1216965.1216966
Publisher site
See Article on Publisher Site

Abstract

Integer problems are ones in which the variables are required to have integer answers. All of the variables may be required to be integer or only some of the variables. This latter is called mixed integer programming. Some problems only require that the integer variables take on the value of 0 or 1 while other problems allow a range of integer values such as 0, 1, 2, 3, or 4.

Journal

ACM SIGMAP BulletinAssociation for Computing Machinery

Published: Jun 1, 1972

There are no references for this article.