Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Level-Dependent Experimental Optimization

lliya Bluskov1
1 Department of Mathematics and Computer Science University of Northern British Columbia Prince George, B.C., Canada V2N 4Z9
  • Published: 31/08/2002

Abstract

In this paper, we discuss a self-adjusting and self-improving combinatorial optimization algorithm. Variations of this algorithm have been successfully applied in recent research in Design Theory. The approach is simple but general and can be applied in any instance of a combinatorial optimization problem.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
lliya Bluskov. Level-Dependent Experimental Optimization[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 042. 139-145. DOI: .