Sciweavers

600 search results - page 1 / 120
» Solving Distributed Constraint Optimization Problems Using L...
Sort
View
CP
2009
Springer
14 years 9 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
ENTCS
2007
190views more  ENTCS 2007»
13 years 8 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
ATAL
2004
Springer
14 years 1 months ago
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
Distributed Constraint Optimization Problems (DCOP) have, for a long time, been considered an important research area for multi-agent systems because a vast number of realworld si...
Roger Mailler, Victor R. Lesser
CP
2003
Springer
14 years 1 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
CSCLP
2007
Springer
14 years 2 months ago
Preference-Based Problem Solving for Constraint Programming
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
Ulrich Junker