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 by partitioning

Integer programming by partitioning Integer Programming problems can be solved by a variety of methods. These can be grouped as follows:Complete EnumerationImplicit EnumerationBranch and BoundCutting PlanesPartitioningAsymptotic (or Group) TheoryConvex Analysis.The first two were discussed in educational series #2. This paper discusses the partitioning approach. This approach was first proposed by Dr. J. F. Benders in 1962. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGMAP Bulletin Association for Computing Machinery

Integer programming by partitioning

ACM SIGMAP Bulletin , Volume (13) – Jan 1, 1973

Loading next page...
 
/lp/association-for-computing-machinery/integer-programming-by-partitioning-VqlYVFO7ou

References (1)

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

Abstract

Integer Programming problems can be solved by a variety of methods. These can be grouped as follows:Complete EnumerationImplicit EnumerationBranch and BoundCutting PlanesPartitioningAsymptotic (or Group) TheoryConvex Analysis.The first two were discussed in educational series #2. This paper discusses the partitioning approach. This approach was first proposed by Dr. J. F. Benders in 1962.

Journal

ACM SIGMAP BulletinAssociation for Computing Machinery

Published: Jan 1, 1973

There are no references for this article.