Sciweavers

JAL
2006
175views more  JAL 2006»
13 years 4 months ago
Approximations for minimum and min-max vehicle routing problems
: 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 ...
Esther M. Arkin, Refael Hassin, Asaf Levin
CSDA
2007
75views more  CSDA 2007»
13 years 4 months ago
Robust counterparts of errors-in-variables problems
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...
G. A. Watson
JEA
2008
88views more  JEA 2008»
13 years 4 months ago
Multilevel algorithms for linear ordering problems
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, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
INFSOF
2006
102views more  INFSOF 2006»
13 years 4 months ago
Comparison of software architecture reverse engineering methods
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...
CORR
2007
Springer
127views Education» more  CORR 2007»
13 years 4 months ago
Using decision problems in public key cryptography
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...
Vladimir Shpilrain, Gabriel Zapata
CONSTRAINTS
2007
89views more  CONSTRAINTS 2007»
13 years 4 months ago
Cardinal: A Finite Sets Constraint Solver
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 ...
Francisco Azevedo
IJHCI
2006
95views more  IJHCI 2006»
13 years 4 months ago
Problem Prioritization in Usability Evaluation: From Severity Assessments Toward Impact on Design
Severity assessments enable prioritization of problems encountered during usability evaluations and thereby provide a device for guiding the utilization of design resources. Howeve...
Morten Hertzum
ISCI
2008
159views more  ISCI 2008»
13 years 4 months ago
Large scale evolutionary optimization using cooperative coevolution
Evolutionary algorithms (EAs) have been applied with success to many numerical and combinatorial optimization problems in recent years. However, they often lose their effectivenes...
Zhenyu Yang, Ke Tang, Xin Yao
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
13 years 4 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
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...
Petr Kolman, Tomasz Walen
HEURISTICS
2006
197views more  HEURISTICS 2006»
13 years 5 months ago
Bucket elimination for multiobjective optimization problems
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
Emma Rollon, Javier Larrosa