Pages that link to "Item:Q859710"

The following pages link to Theoretical aspects of local search. (Q859710):

Displaying 20 items.

• Smoothed performance guarantees for local search (Q403643) (← links)
• Local search: is brute-force avoidable? (Q439931) (← links)
• Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
• Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
• Minimizing Rosenthal potential in multicast games (Q493648) (← links)
• Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem (Q494929) (← links)
• Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
• Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• On benefits and drawbacks of aging strategies for randomized search heuristics (Q627105) (← links)
• On the effectiveness of immune inspired mutation operators in some discrete optimization problems (Q781286) (← links)
• The impact of parametrization in memetic evolutionary algorithms (Q1029357) (← links)
• Alternative evaluation functions for the cyclic bandwidth sum problem (Q1631512) (← links)
• Local search inequalities (Q1751111) (← links)
• A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups (Q1761169) (← links)
• Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
• On the parameterized complexity of consensus clustering (Q2015135) (← links)
• Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
• Nonoblivious 2-Opt heuristics for the traveling salesman problem (Q2811309) (← links)
• Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)