Results 1  10
of
134
Truthful approximation mechanisms for restricted combinatorial auctions
, 2002
"... When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCGlike payment rules will not ensure truthfulness). We dev ..."
Abstract

Cited by 103 (4 self)
 Add to MetaCart
When attempting to design a truthful mechanism for a computationally hard problem such as combinatorial auctions, one is faced with the problem that most efficiently computable heuristics can not be embedded in any truthful mechanism (e.g. VCGlike payment rules will not ensure truthfulness). We develop a set of techniques that allow constructing efficiently computable truthful mechanisms for combinatorial auctions in the special case where each bidder desires a specific known subset of items and only the valuation is unknown by the mechanism (the single parameter case). For this case we extend the work of Lehmann O’Callaghan, and Shoham, who presented greedy heuristics. We show how to use IFTHENELSE constructs, perform a partial search, and use the LP relaxation. We apply these techniques for several canonical types of combinatorial auctions, obtaining truthful mechanisms with provable approximation ratios. 1
Efficient algorithms for web services selection with endtoend qos constraints
 ACM Transactions on the Web (TWEB
"... ServiceOriented Architecture (SOA) provides a flexible framework for service composition. Using standardbased protocols (such as SOAP and WSDL), composite services can be constructed by integrating atomic services developed independently. Algorithms are needed to select service components with var ..."
Abstract

Cited by 88 (1 self)
 Add to MetaCart
ServiceOriented Architecture (SOA) provides a flexible framework for service composition. Using standardbased protocols (such as SOAP and WSDL), composite services can be constructed by integrating atomic services developed independently. Algorithms are needed to select service components with various QoS levels according to some applicationdependent performance requirements. We design a brokerbased architecture to facilitate the selection of QoSbased services. The objective of service selection is to maximize an applicationspecific utility function under the endtoend QoS constraints. The problem is modeled in two ways: the combinatorial model and the graph model. The combinatorial model defines the problem as a multidimension multichoice 01 knapsack problem (MMKP). The graph model defines the problem as a multiconstraint optimal path (MCOP) problem. Efficient heuristic algorithms for service processes of different composition structures are presented in this article and their performances are studied by simulations. We also compare the pros and cons between the two models.
Global Constraints as Graph Properties on Structured Network of Elementary Constraints of the Same Type
, 2000
"... This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in ..."
Abstract

Cited by 75 (11 self)
 Add to MetaCart
This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in term of graph properties that have to hold, where the graph is a structured network of same elementary constraints. Since this classification is based on the internal structure of the global constraints it is also a strong hint for the pruning algorithms of the global constraints. Keywords Constraint, finite domain, global constraint, classification, resource constraint scheduling, graph partitioning, timetabling. 2 Table of contents Table of contents ....................................................................................................................................................... 2 Table of figures.........................................................................
The hypercube framework for ant colony optimization
, 2004
"... Ant colony optimization is a metaheuristic approach belonging to the class of modelbased search algorithms. In this paper, we propose a new framework for implementing ant colony optimization algorithms called the hypercube framework for ant colony optimization. In contrast to the usual way of impl ..."
Abstract

Cited by 53 (21 self)
 Add to MetaCart
Ant colony optimization is a metaheuristic approach belonging to the class of modelbased search algorithms. In this paper, we propose a new framework for implementing ant colony optimization algorithms called the hypercube framework for ant colony optimization. In contrast to the usual way of implementing ant colony optimization algorithms, this framework limits the pheromone values to the interval [0,1]. This is obtained by introducing changes in the pheromone value update rule. These changes can in general be applied to any pheromone value update rule used in ant colony optimization. We discuss the benefits coming with this new framework. The benefits are twofold. On the theoretical side, the new framework allows us to prove that in Ant System, the ancestor of all ant colony optimization algorithms, the average quality of the solutions produced increases in expectation over time when applied to unconstrained problems. On the practical side, the new framework automatically handles the scaling of the objective function values. We experimentally show that this leads on average to a more robust behavior of ant colony optimization algorithms.
K.: Service selection algorithms for composing complex services with multiple qos constraints
 In: ICSOC’05: 3rd Int. Conf. on Service Oriented Computing
, 2005
"... Abstract. One of the promises of the serviceoriented architecture (SOA) is that complex services can be composed using individual services. Individual services can be selected and integrated either statically or dynamically based on the service functionalities and performance constraints. For many ..."
Abstract

Cited by 39 (0 self)
 Add to MetaCart
(Show Context)
Abstract. One of the promises of the serviceoriented architecture (SOA) is that complex services can be composed using individual services. Individual services can be selected and integrated either statically or dynamically based on the service functionalities and performance constraints. For many distributed applications, the runtime performance (e.g. endtoend delay, cost, reliability and availability) of complex services are very important. In our earlier work, we have studied the service selection problem for complex services with only one QoS constraint. This paper extends the service selection problem to multiple QoS constraints. The problem can be modelled in two ways: the combinatorial model and the graph model. The combinatorial model defines the problem as the multidimension multichoice 01 knapsack problem (MMKP). The graph model defines the problem as the multiconstraint optimal path (MCOP) problem. We propose algorithms for both models and study their performances by test cases. We also compare the pros & cons between the two models. 1
Maximizing Submodular Set Functions Subject to Multiple Linear Constraints
, 2009
"... The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we presen ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
(Show Context)
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we present the first known approximation algorithms for the problem of maximizing a nondecreasing submodular set function subject to multiple linear constraints. Given a ddimensional budget vector ¯ L, for some d ≥ 1, and an oracle for a nondecreasing submodular set function f over a universe U, where each element e ∈ U is associated with a ddimensional cost vector, we seek a subset of elements S ⊆ U whose total cost is at most ¯ L, such that f(S) is maximized. We develop a framework for maximizing submodular functions subject to d linear constraints that yields a (1 − ε)(1 − e−1)approximation to the optimum for any ε> 0, where d> 1 is some constant. Our study is motivated by a variant of the classical maximum coverage problem that we call maximum coverage with multiple packing constraints. We use our framework to obtain the same approximation ratio for this problem. To the best of our knowledge, this is the first time the theoretical bound of 1 − e−1 is (almost) matched for both of these problems.
Polynomial Time Approximation Schemes for ClassConstrained Packing Problems
 Proc. of Workshop on Approximation Algorithms
, 1999
"... . We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of different classes (colors) need to be placed in bins; the items may have different sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
(Show Context)
. We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of different classes (colors) need to be placed in bins; the items may have different sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can hold. In the classconstrained multiple knapsack (CCMK) problem, our goal is to maximize the total value of packed items, whereas in the classconstrained binpacking (CCBP), we seek to minimize the number of (identical) bins, needed for packing all the items. We give a polynomial time approximation scheme (PTAS) for CCMK and a dual PTAS for CCBP. We also show that the 01 classconstrained knapsack admits a fully polynomial time approximation scheme, even when the number of distinct colors of items depends on the input size. Finally, we introduce the generalized classconstrained packing problem (GCCP), where each item may have more than one color. We show that GCCP is APX...
On Two ClassConstrained Versions of the Multiple Knapsack Problem
, 2001
"... We study two variants of the classic knapsack problem, in which we need to place items of different types in multiple knapsacks; each knapsack has a limited capacity, and a bound on the number of different types of items it can hold: in the classconstrained multiple knapsack problem (CMKP) we wis ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
(Show Context)
We study two variants of the classic knapsack problem, in which we need to place items of different types in multiple knapsacks; each knapsack has a limited capacity, and a bound on the number of different types of items it can hold: in the classconstrained multiple knapsack problem (CMKP) we wish to maximize the total number of packed items; in the fair placement problem (FPP) our goal is to place the same (large) portion from each set. We look for a perfect placement, in which both problems are solved optimally. We first show that the two problems are NPhard; we then consider some special cases, where a perfect placement exists and can be found in polynomial time. For other cases, we give approximate solutions. Finally, we give a nearly optimal solution for the CMKP. Our results for the CMKP and the FPP are shown to provide efficient solutions for two fundamental problems arising in multimedia storage subsystems.
An expandingcore algorithm for the exact 01 Knapsack Problem.
 European Journal of Operational Research
, 1993
"... A new branchandbound algorithm for the exact solution of the 01 Knapsack Problem is presented. The algorithm is based on solving an "expanding core", which initially only contains the break item, but which is expanded each time the branchandbound algorithm reaches the border of the co ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
A new branchandbound algorithm for the exact solution of the 01 Knapsack Problem is presented. The algorithm is based on solving an "expanding core", which initially only contains the break item, but which is expanded each time the branchandbound algorithm reaches the border of the core. Computational experiments show that most data instances are optimally solved without sorting or preprocessing a great majority of the items. Detailed program sketches are provided, and computational experiments are reported, indicating that the algorithm presented not only is shorter, but also faster and more stable than any other algorithm hitherto proposed.