: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Of interest here are linear data fitting problems with uncertain data which lie in a given uncertainty set. A robust counterpart of such a problem may be interpreted as the probl...
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Problems related to interactions between components is a sign of problems with the software architecture of the system and are often costly to fix. Thus it is very desirable to id...
Catherine Stringfellow, C. D. Amory, Dileep Potnur...
There are several public key establishment protocols as well as complete public key cryptosystems based on allegedly hard problems from combinatorial (semi)group theory known by no...
In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECLiPSe Prolog, suitable for combinatorial problem solving by exploiting ...
Severity assessments enable prioritization of problems encountered during usability evaluations and thereby provide a device for guiding the utilization of design resources. Howeve...
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...