Sciweavers

16596 search results - page 195 / 3320
» Generalized Assignment Problems
Sort
View
EVOW
2008
Springer
15 years 4 months ago
Metaheuristics for the Bi-objective Ring Star Problem
The bi-objective 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, r...
Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basse...
EVOW
2008
Springer
15 years 4 months ago
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
Yuichi Nagata, Olli Bräysy
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
15 years 9 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
87
Voted
SIGECOM
2009
ACM
92views ECommerce» more  SIGECOM 2009»
15 years 9 months ago
The adwords problem: online keyword matching with budgeted bidders under random permutations
We consider the problem of a search engine trying to assign a sequence of search keywords to a set of competing bidders, each with a daily spending limit. The goal is to maximize ...
Nikhil R. Devenur, Thomas P. Hayes
108
Voted
IAT
2008
IEEE
15 years 9 months ago
Negotiation in Semi-cooperative Agreement Problems
In this paper we introduce the Semi-Cooperative Extended Incremental Multiagent Agreement Problem with Preferences (SC-EIMAPP). In SC-EIMAPPs, variables arise over time. For each ...
Elisabeth Crawford, Manuela M. Veloso