
Instance Scale, Numerical Properties and Design of Metaheuristics: A Study for the Facility Location Problem
Metaheuristics are known to be strong in solving largescale instances o...
read it

Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
The Minimum Vertex Cover (MinVC) problem is a wellknown NPhard problem...
read it

Local search breaks 1.75 for Graph Balancing
Graph Balancing is the problem of orienting the edges of a weighted mult...
read it

On Finding Maximum Cardinality Subset of Vectors with a Constraint on Normalized Squared Length of Vectors Sum
In this paper, we consider the problem of finding a maximum cardinality ...
read it

Fuzzy Simultaneous Congruences
We introduce a very natural generalization of the wellknown problem of ...
read it

The Product Knapsack Problem: Approximation and Complexity
We consider the product knapsack problem, which is the variant of the cl...
read it

FAMOUS: Fast Approximate string Matching using OptimUm search Schemes
Finding approximate occurrences of a pattern in a text using a fulltext...
read it
Timecritical testing and search problems
This paper introduces a problem in which the state of a system needs to be determined through costly tests of its components by a limited number of testing units and before a given deadline. We also consider a closely related search problem in which there are multiple searchers to find a target before a given deadline. These natural generalizations of the classical sequential testing problem and search problem are applicable in a wide range of timecritical operations such as machine maintenance, diagnosing a patient, and new product development. We show that both problems are NPhard, develop a pseudopolynomial dynamic program for the special case of two time slots, and describe a partialorderbased as well as an assignmentbased mixed integer program for the general case. Based on extensive computational experiments, we find that the assignmentbased formulation performs better than the partialorderbased formulation for the testing variant, but that this is the other way round for the search variant. Finally, we propose a pairwiseinterchangebased local search procedure and show that, empirically, it performs very well in finding nearoptimal solutions.
READ FULL TEXT
Comments
There are no comments yet.