AbstractWe briefly review the application of local search to a special class of coding problems: covering and packing. To use local search techniques, covering and packing problems are viewed as combinatorial optimization problems. The advantage of local search is that it can be applied without the use of deep combinatorial arguments. However, the required computation times can be quite large
© 2008 Muhammad Rafiq Bin Muhammad.This thesis investigates the use of local search methods in solvi...
Local search metaheuristics are a recognized means of solving hard com- binatorial problems. Over th...
Local Search is one of the fundamental approaches to combinatorial optimization and it is used throu...
We briefly review the application of local search to a special class of coding problems: covering an...
AbstractWe briefly review the application of local search to a special class of coding problems: cov...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
International audienceThis chapter sets up a formal framework for local search and provides a certai...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
The discrete optimization technique called local search yields impressive results on many important ...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
. We propose in this paper a novel way of looking at local search algorithms for combinatorial optim...
. The goal of this paper is twofold. First, we introduce a class of local search procedures for solv...
National Nature Science Foundation of China [60773126]This paper presents an extended local search a...
In this article, a local search approach is proposed for three variants of the bi-objective binary k...
© 2008 Muhammad Rafiq Bin Muhammad.This thesis investigates the use of local search methods in solvi...
Local search metaheuristics are a recognized means of solving hard com- binatorial problems. Over th...
Local Search is one of the fundamental approaches to combinatorial optimization and it is used throu...
We briefly review the application of local search to a special class of coding problems: covering an...
AbstractWe briefly review the application of local search to a special class of coding problems: cov...
Local search has been applied successfully to a diverse collection of optimization problems. It's ap...
International audienceThis chapter sets up a formal framework for local search and provides a certai...
Local search is a widely used method to solve combinatorial optimization problems. As many relevant ...
The discrete optimization technique called local search yields impressive results on many important ...
This book covers local search for combinatorial optimization and its extension to mixed-variable opt...
. We propose in this paper a novel way of looking at local search algorithms for combinatorial optim...
. The goal of this paper is twofold. First, we introduce a class of local search procedures for solv...
National Nature Science Foundation of China [60773126]This paper presents an extended local search a...
In this article, a local search approach is proposed for three variants of the bi-objective binary k...
© 2008 Muhammad Rafiq Bin Muhammad.This thesis investigates the use of local search methods in solvi...
Local search metaheuristics are a recognized means of solving hard com- binatorial problems. Over th...
Local Search is one of the fundamental approaches to combinatorial optimization and it is used throu...
DOI
Add to ORKG