1 - 4 of 4 articles
A current version of the Davies, Swann and Campey algorithm is stated. An estimate of the error at each iteration is then derived. This estimate is used to show that the current version is inefficient in a certain sense. A modified algorithm is then defined, implemented, and tested. The results...
These are comments on the recursion research results reported by C. A. Haverly in this issue of SIGMAP Bulletin. The particular figures used introduce a fascinatingly unco-operative model, with a split "useful answer" area.
This note describes the actual steps taken by the author in attempting to get insight into the effective solution of a hard integer program. A reduction in CPU time of around 97% was eventually achieved, but the major purpose of the note is to reinforce the moral that a subtlety of approach is...
A study of the behavior of LP models is a badly neglected area. By model behavior I mean the way the answers of an LP model vary as the input data is varied. In some cases, we find the model behaves much like the system being modeled. But in other cases it has quite different properties. Some of...
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.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.