Keyword: heuristics

Found 5460 papers in total
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
2016,
We introduce a relaxed‐projection splitting algorithm for solving variational...
Time-hierarchical scheduling
Time-hierarchical scheduling
2016,
In this paper, the general time hierarchical planning and scheduling approach is...
Optimality Functions and Lopsided Convergence
Optimality Functions and Lopsided Convergence
2016,
Optimality functions pioneered by E. Polak characterize stationary points, quantify...
Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques
Solving Disjunctive Optimization Problems by Generalized Semi-infinite Optimization Techniques
2016,
We describe a new possibility to model disjunctive optimization problems as...
Differentiability Properties of Metric Projections onto Convex Sets
Differentiability Properties of Metric Projections onto Convex Sets
2016,
It is known that directional differentiability of metric projection onto a closed...
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
2016,
We introduce a first‐order method for solving very large convex cone programs....
Decomposition of Differential Games with Multiple Targets
Decomposition of Differential Games with Multiple Targets
2016,
This paper provides a decomposition technique for the purpose of simplifying the...
Optimality Conditions for Semi-Infinite and Generalized Semi-Infinite Programs Via Lower Order Exact Penalty Functions
Optimality Conditions for Semi-Infinite and Generalized Semi-Infinite Programs Via Lower Order Exact Penalty Functions
2016,
In this paper, we will study optimality conditions of semi‐infinite programs...
Galerkin Optimal Control
Galerkin Optimal Control
2016,
This paper introduces a family of computational methods for solving optimal control...
Modelling the mobile target covering problem using flying drones
Modelling the mobile target covering problem using flying drones
2016,
This paper addresses the mobile targets covering problem by using unmanned aerial...
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
2016,
We propose a Lagrangian heuristic for facility location problems with concave cost...
Matroid and Knapsack Center Problems
Matroid and Knapsack Center Problems
2016,
In the classic k ‐center problem, we are given a metric graph, and the...
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information
2016,
Although widely applied in optimisation, relatively little has been proven rigorously...
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
AND-Compression of NP-Complete Problems: Streamlined Proof and Minor Observations
2016,
Drucker (Proceedings of the 53rd annual symposium on foundations of computer science...
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem
2016,
In this paper, we consider the Unsplittable (hard) Capacitated Facility Location...
Chordal Editing is Fixed-Parameter Tractable
Chordal Editing is Fixed-Parameter Tractable
2016,
Graph modification problems are typically asked as follows: is there a small set of...
Two-Page Book Embeddings of 4-Planar Graphs
Two-Page Book Embeddings of 4-Planar Graphs
2016,
Back in the eighties, Heath [Algorithms for embedding graphs in books. PhD thesis,...
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
The Impact of Random Initialization on the Runtime of Randomized Search Heuristics
2016,
Analyzing the runtime of a Randomized Search Heuristic (RSH) by theoretical means...
The Parameterized Complexity of Geometric Graph Isomorphism
The Parameterized Complexity of Geometric Graph Isomorphism
2016,
We study the parameterized complexity of Geometric Graph Isomorphism (Known as the...
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems
Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems
2016,
The ( 1 + 1 ) EA is a simple evolutionary algorithm that is known to be efficient...
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree
2016,
A commonly studied means of parameterizing graph problems is the deletion distance...
Concentration of First Hitting Times Under Additive Drift
Concentration of First Hitting Times Under Additive Drift
2016,
Recent advances in drift analysis have given us better and better tools for...
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth
2016,
In this paper we prove a space lower bound of n Ω ( k ) for...
A Parameterized Study of Maximum Generalized Pattern Matching Problems
A Parameterized Study of Maximum Generalized Pattern Matching Problems
2016,
The generalized function matching (GFM) problem has been intensively studied starting...
Papers per page: