Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Benders (1962)
Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 4
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.
ACM SIGMAP Bulletin – Association for Computing Machinery
Published: Jan 1, 1973
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.