Results 1  10
of
182,601
Metaheuristics for the Biobjective Ring Star Problem
"... Abstract. The biobjective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from nonvisited ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. The biobjective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, related to the length of the cycle, whereas the second one is to minimize an assignment cost, from non
Metaheuristics and cooperative approaches for the Biobjective Ring Star Problem, in "Computers
 Operations Research
"... This paper presents and investigates different approaches to solve a new biobjective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The first objective is the minimization of a ring cost t ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper presents and investigates different approaches to solve a new biobjective routing problem called the ring star problem. It consists of locating a simple cycle through a subset of nodes of a graph while optimizing two kinds of cost. The first objective is the minimization of a ring cost
On the Integration of a TSP Heuristic into an EA for the Biobjective Ring Star Problem
 in "International Workshop on Hybrid Metaheuristics (HM 2008), Malaga, Spain", Lecture Notes in Computer Science
"... Abstract. This paper discusses a new hybrid solution method for a biobjective routing problem, namely the biobjective ring star problem. The biobjective ring star problem is a generalization of the ring star problem in which the assignment cost has been dissociated from the cost of visiting a sub ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. This paper discusses a new hybrid solution method for a biobjective routing problem, namely the biobjective ring star problem. The biobjective ring star problem is a generalization of the ring star problem in which the assignment cost has been dissociated from the cost of visiting a
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
, 2008
"... ..."
The ant colony optimization metaheuristic
 in New Ideas in Optimization
, 1999
"... Ant algorithms are multiagent systems in which the behavior of each single agent, called artificial ant or ant for short in the following, is inspired by the behavior of real ants. Ant algorithms are one of the most successful examples of swarm intelligent systems [3], and have been applied to many ..."
Abstract

Cited by 385 (23 self)
 Add to MetaCart
to many types of problems, ranging from the classical traveling salesman
Modeling Strategic Relationships for Process Reengineering
, 1995
"... Existing models for describing a process (such as a business process or a software development process) tend to focus on the \what " or the \how " of the process. For example, a health insurance claim process would typically be described in terms of a number of steps for assessing and appr ..."
Abstract

Cited by 545 (40 self)
 Add to MetaCart
plans? An understanding of the motivations and interests of process participants is often crucial to the successful redesign of processes. This thesis proposes a modelling framework i (pronounced istar) consisting of two modelling components. The Strategic Dependency (SD) model describes a process
Primitives for the manipulation of general subdivisions and the computations of Voronoi diagrams
 ACM Tmns. Graph
, 1985
"... The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms ar ..."
Abstract

Cited by 543 (11 self)
 Add to MetaCart
The following problem is discussed: Given n points in the plane (the sites) and an arbitrary query point 4, find the site that is closest to q. This problem can be solved by constructing the Voronoi diagram of the given sites and then locating the query point in one of its regions. Two algorithms
The English noun phrase in its sentential aspect
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under assump ..."
Abstract

Cited by 509 (4 self)
 Add to MetaCart
assumptions now standard within the GovernmentBinding (GB) framework. The central empirical problem addressed is the question of the proper analysis of the socalled \Possing " gerund in English. This construction possesses simultaneously many properties of sentences, and many properties of noun
Results 1  10
of
182,601