Add to ORKGUniversité Libre de Bruxelles, Brussels, BelgiumTR/IRIDIA/2007-003info:eu-repo/semantics/publishe
The probabilistic traveling salesman problem is a paradigmatic example of a stochastic combinatorial...
International audienceMany stochastic local search (SLS) methods rely on the manipulation of single ...
Combinatorial optimisation problems are an important and well-studied class of problems, with applic...
The information provided is the sole responsibility of the authors and does not necessarily reflect ...
[1] Sergienko I.V., Kaspshitskaya M.F. Models and methods solving combinatorial optimization problem...
The main objective of this paper is to provide a state-of-the-art review, analyze and discuss stocha...
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for ...
Université Libre de Bruxelles, Brussels, BelgiumTR/IRIDIA/2007-014info:eu-repo/semantics/publishe
Combinatorial optimization problems can be found in many aspects ofmanufacturing, computer science, ...
Accelerated probabilistic modeling algorithms, presenting stochastic local search (SLS) technique, a...
Iterated Local Search (ILS) is one of the most popular single-solution-based metaheuristics. ILS is ...
This dissertation is concerned with configuring stochastic local search for combinatorial optimizati...
A local search algorithm for the optimization of the stochastic economic lot scheduling problem / M....
Many stochastic local search (SLS) methods rely on the manipulation of single solutions at each of t...
In this chapter, we give an overview of the main concepts underlying the stochastic local search (SL...
The probabilistic traveling salesman problem is a paradigmatic example of a stochastic combinatorial...
International audienceMany stochastic local search (SLS) methods rely on the manipulation of single ...
Combinatorial optimisation problems are an important and well-studied class of problems, with applic...
The information provided is the sole responsibility of the authors and does not necessarily reflect ...
[1] Sergienko I.V., Kaspshitskaya M.F. Models and methods solving combinatorial optimization problem...
The main objective of this paper is to provide a state-of-the-art review, analyze and discuss stocha...
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for ...
Université Libre de Bruxelles, Brussels, BelgiumTR/IRIDIA/2007-014info:eu-repo/semantics/publishe
Combinatorial optimization problems can be found in many aspects ofmanufacturing, computer science, ...
Accelerated probabilistic modeling algorithms, presenting stochastic local search (SLS) technique, a...
Iterated Local Search (ILS) is one of the most popular single-solution-based metaheuristics. ILS is ...
This dissertation is concerned with configuring stochastic local search for combinatorial optimizati...
A local search algorithm for the optimization of the stochastic economic lot scheduling problem / M....
Many stochastic local search (SLS) methods rely on the manipulation of single solutions at each of t...
In this chapter, we give an overview of the main concepts underlying the stochastic local search (SL...
The probabilistic traveling salesman problem is a paradigmatic example of a stochastic combinatorial...
International audienceMany stochastic local search (SLS) methods rely on the manipulation of single ...
Combinatorial optimisation problems are an important and well-studied class of problems, with applic...