A Class of Direct Search Methods for Nonlinear Integer Programming

  • Stephen Sugden

Student thesis: Doctoral Thesis


The overriding goal for the work described in this thesis is to obtain a good integer-feasible or near-integer-feasible solution to the general NLIP problem while trying to avoid or at least minimize the use of the ubiquitous branch-and-bound techniques.
Date of AwardJul 1992
Original languageEnglish
SupervisorBruce Murtagh (Supervisor)

Cite this