[CITATION][C] A bound-improving approach to discrete programming problems
P Bárcia, JD Coelho - Mathematical programming, 1994 - Springer
P Bárcia, JD Coelho
Mathematical programming, 1994•Springer… In Section 2 a bound-improving sequence algorithm for discrete programming problems
is presented and its finite convergence proved under a specific assumption. Finally in
Section 3 some concluding comments are put forward. … In this note we have extended the
idea of bound improving sequences to general discrete programming problems. The main
contribution of this approach is to transform discrete programming problems with several
constraints into a sequence of single constrained problems which are, hopefully, easier to …
is presented and its finite convergence proved under a specific assumption. Finally in
Section 3 some concluding comments are put forward. … In this note we have extended the
idea of bound improving sequences to general discrete programming problems. The main
contribution of this approach is to transform discrete programming problems with several
constraints into a sequence of single constrained problems which are, hopefully, easier to …
Abstract
This note deals with the extension of the bound-improving sequence idea to general discrete programming problems.
Springer
Showing the best result for this search. See all results