Pages that link to "Item:Q5901738"
From MaRDI portal
The following pages link to Evolutionary Computation in Combinatorial Optimization (Q5901738):
Displaying 9 items.
- Generating new test instances by evolving in instance space (Q342041) (← links)
- Autocorrelation measures for the quadratic assignment problem (Q429187) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Generating QAP instances with known optimum solution and additively decomposable cost function (Q887857) (← links)
- Backbone analysis and algorithm design for the quadratic assignment problem (Q954381) (← links)
- QAPLIB - a quadratic assignment problem library (Q1361076) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
- Where the really hard quadratic assignment problems are: the QAP-SAT instances (Q6635983) (← links)