.

(2017) Interference Minimization in D2D Communication Underlaying Cellular Networks. To learn more about the use of cookies, please read our







.

Algorithms and Data Structures, 519-529.



(2017) Optimisation and heuristic approaches for assigning inbound containers to outbound carriers.



(2008) Complexity of local search for the p-median problem.


(2019) An online resource allocation algorithm to minimize system interference for inband underlay D2D communications.





Approximate Local Search in Combinatorial OptimizationCopyright © 2004 Society for Industrial and Applied Mathematics (2020) A class of exponential neighbourhoods for the quadratic travelling salesman problem.



This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management …



2009. Physica A: Statistical Mechanics and its Applications Algorithmic Game Theory, 200-215. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. (2009) MultiProcessor Scheduling is PLS-Complete. We introduce the concept of $\varepsilon$-local optimality and show that, for every $\varepsilon > 0$, an $\varepsilon$-local optimum can be identified in time polynomial in the problem size and $1/\varepsilon$ whenever the corresponding neighborhood can be searched in polynomial time. English.

(2013) Nonoblivious 2-Opt heuristics for the traveling salesman problem.

(2011) Artificial Fish Algorithm to Solve Traveling Salesman Problem. (2012) Divide-and-conquer memetic algorithm for online multi-objective test paper generation.














Inthispaper,weshowthateverycombinatorialop-



Algorithms and Data Structures, 459-470.



(2019) A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem.



Université Montpellier, 2015.





If the neighborhood can be searched in polynomial time for a $\delta$-local optimum, a variation of our main algorithm produces a $(\delta + \varepsilon)$-local optimum in time polynomial in the problem size and $1/\varepsilon$.





Editors (view affiliations) Luís Paquete; Christine …



















.

Efficient local search for several combinatorial optimization problems.