Results 141 to 150 of about 2,708 (158)

A new MIP Heuristic based on Randomized Neighborhood Search

2011
A new simple MIP heuristic, called Randomized Neighborhood Search (RANS) is proposed, whose purpose is to produce within short time bounds high quality solutions especially for large size MIP problems as the ones characterizing real industrial applications.
ANGHINOLFI, DAVIDE, PAOLUCCI, MASSIMO
openaire   +1 more source

The use of tail inequalities on the probable computational time of randomized search heuristics

Theoretical Computer Science, 2012
Ruqian Lu, Zhangang Han
exaly  

Decomposition of Fitness Functions in Random Heuristic Search

2007
Yossi Borenstein, Riccardo Poli
openaire   +1 more source

Analyzing Randomized Search Heuristics: Tools from Probability Theory

Theoretical Computer Science, 2011
Benjamin Doerr
exaly  

Parameterized Complexity Analysis of Randomized Search Heuristics

Natural Computing Series, 2020
Frank Neumann, Andrew M Sutton, Sutton Andrew M   +2 more
exaly  

Black-Box Complexity for Bounding the Performance of Randomized Search Heuristics

Natural Computing Series, 2014
Thomas Jansen
exaly  

The Impact of Random Initialization on the Runtime of Randomized Search Heuristics

Algorithmica, 2015
Benjamin Doerr, Carola Doerr, Doerr Benjamin   +2 more
exaly  

Finding large cliques in sparse semi-random graphs by simple randomized search heuristics

Theoretical Computer Science, 2007
Tobias Storch
exaly  

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem

Evolutionary Computation, 2017
Frank Neumann, Dirk Sudholt, Sudholt Dirk   +2 more
exaly  

A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem

Operations Research, 1994
Thomas A Feo
exaly