Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Williams (1978)
The reformulation of two mixed integer programming problemsMathematical Programming, 14
H. Williams (1973)
Simplifying linear programming problems
Efficient model formulation rules have been established for mixed and pure integer problems to improve solution times for the branch and bound algorithm. These techniques have been implemented in the automatic model re-formulator of APEX IV. The effect of those techniques in significantly reducing solution times on several large models will be presented.
ACM SIGMAP Bulletin – Association for Computing Machinery
Published: Apr 1, 1983
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.