Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems

DOI10.1287/IJOC.1040.0064MaRDI QIDQ2892260zbMATH OpenOpenAlexFDO

Authors Diane E. Vaughan, Sheldon H. Jacobson, Laura A. Mclay, Shane N. Hall

Publication date 18 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL http://scholar.lib.vt.edu/theses/available/etd-08042000-14590003/

zbMATH Keywords

analysis of algorithmsprobability Markov processessuboptimal algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Combinatorial optimization (90C27)

Recommendations

• Analyzing the performance of simultaneous generalized hill climbing algorithms
• A class of convergent generalized hill climbing algorithms
• On the convergence of generalized hill climbing algorithms
• A convergence analysis of generalized hill climbing algorithms
• Tabu guided generalized Hill climbing algorithms

Cited in

(5)

• Ordinal hill climbing algorithms for discrete manufacturing process design optimization problems
• A class of convergent generalized hill climbing algorithms
• Optimal search strategies using simultaneous generalized hill climbing algorithms
• Analyzing the performance of simultaneous generalized hill climbing algorithms
• Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems

This page was built for publication: Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892260)