A review of methodological approaches for the design and optimization of wind farms

JF Herbert-Acero, O Probst, PE Réthoré, GC Larsen… - Energies, 2014 - mdpi.com
This article presents a review of the state of the art of the Wind Farm Design and
Optimization (WFDO) problem. The WFDO problem refers to a set of advanced planning …

A tutorial on AI-powered 3D deployment of drone base stations: State of the art, applications and challenges

N Parvaresh, M Kulhandjian, H Kulhandjian… - Vehicular …, 2022 - Elsevier
Deploying uncrewed aerial vehicles (UAVs) as aerial base stations (BSs) to assist terrestrial
connectivity has drawn significant attention in recent years. Alongside other UAV types …

The maximum clique problem

IM Bomze, M Budinich, PM Pardalos… - Handbook of Combinatorial …, 1999 - Springer
The maximum clique problem is a classical problem in combinatorial optimization which
finds important applications in different domains. In this paper we try to give a survey of …

[图书][B] Handbook of approximation algorithms and metaheuristics

TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Reactive Local Search for the Maximum Clique Problem 1

R Battiti, M Protasi - Algorithmica, 2001 - Springer
A new Reactive Local Search (\RLS) algorithm is proposed for the solution of the Maximum-
Clique problem.\RLS is based on local search complemented by a feedback (history …

When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?

GJ Woeginger - INFORMS Journal on Computing, 2000 - pubsonline.informs.org
We derive results of the following flavor: If a combinatorial optimization problem can be
formulated via a dynamic program of a certain structure and if the involved cost and …

The complexity and approximability of finding maximum feasible subsystems of linear relations

E Amaldi, V Kann - Theoretical computer science, 1995 - Elsevier
We study the combinatorial problem which consists, given a system of linear relations, of
finding a maximum feasible subsystem, that is a solution satisfying as many relations as …

A short guide to approximation preserving reductions

P Crescenzi - Proceedings of Computational Complexity …, 1997 - ieeexplore.ieee.org
Comparing the complexity of different combinatorial optimization problems has been an
extremely active research area during the last 23 years. This has led to the definition of …

On syntactic versus computational views of approximability

S Khanna, R Motwani, M Sudan, U Vazirani - SIAM Journal on Computing, 1998 - SIAM
We attempt to reconcilethe two distinct views of approximation classes: syntactic and
computational. Syntactic classes such as MAX SNP permit structural results and have …

[图书][B] Applications of combinatorial optimization

VT Paschos - 2014 - books.google.com
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three
major scientific domains: mathematics, theoretical computer science and management. The …