Pages that link to "Item:Q1962048"

The following pages link to On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048):

Displaying 13 items.

• Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
• Autocorrelation measures for the quadratic assignment problem (Q429187) (← links)
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
• A survey for the quadratic assignment problem (Q852928) (← links)
• Evaluation of reliability bounds by set covering models. (Q1424481) (← links)
• Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
• The linear ordering problem: instances, search space analysis and algorithms (Q1774626) (← links)
• Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• An analysis of neighborhood functions on generic solution spaces (Q2462147) (← links)
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
• Rugged and Elementary Landscapes (Q3459673) (← links)
• Construction of the developing connecting tree (Q6094372) (← links)