Showing papers on "Extremal optimization published in 1978"

Point estimation of a global optimum for large combinatorial problems

Abstract: The basis for this paper is in the following observation: for a given “ intractable” optimization problem for which no efficient solution technique exists, if we can devise a systematic procedure for generating independent, heuristic solutions, we should be able to apply statistical extreme-value theory in order to obtain point estimates for the globally optimal solution. This observation has been mechanized in order to evaluate heuristic solutions and assess deviations from optimality, the strategy developed is applicable to a host of combinatorial problems. The assumptions of our model, along with computational experience are discussed.

The use of geometric information in heuristic optimization

Abstract: F II / Best Copy Available ACKNOWLEDGEMENTS This thesis owes its birth to Austin Tate, its growth to Robert Ross, and its completion to Brian Boffey. Particular thanks are due to them. I am grateful for access to computing services at Edinburgh University and the Edinburgh Regional Computing Centre. Further computing facilities were provided by the Liverpool _-University Computer Laboratory. This thesis was produced using the GATE text editing system on the Computati: bnal and. Statistical Science departmental computer system at Liverpool University. Many of the diagrams and tables were prepared by Miss«, M. Ross. Other secretarial services were provided by Liverpool University. CONTENTS Chapter 1 Introduction 1 1.1 Motivation and structure 1 1.2 The 1#-dimensional trim-loss problem 3 1.3 The 2-dimensional trim-loss problem 4