A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper shows how to generalize the Dantzig-Wolfe decomposition principle to integer programming. It does this in a unified way, regardless of the choice between the two main solution methods: 'Branch and bound' or 'cutting plane'. In both instances the authority at the central level issues price dirkctives in the form of a polyhedral, concave price function, where the purpose is to charge the sublevels for the use of central resources including a penalty for any attempts to violate thedoi:10.1016/0166-218x(88)90077-7 fatcat:kqlue6tsgzh7jfx7fjr4rwguja