Sciweavers

11 search results - page 1 / 3
» Modelling Combinatorial Auctions in Linear Logic
Sort
View
KR
2010
Springer
13 years 9 months ago
Modelling Combinatorial Auctions in Linear Logic
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
Daniele Porello, Ulle Endriss
AAAI
2000
13 years 6 months ago
Solving Combinatorial Auctions Using Stochastic Local Search
Combinatorial auctions (CAs) have emerged as an important model in economics and show promise as a useful tool for tackling resource allocation in AI. Unfortunately, winner determ...
Holger H. Hoos, Craig Boutilier
CP
2000
Springer
13 years 9 months ago
Linear Formulation of Constraint Programming Models and Hybrid Solvers
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...
Philippe Refalo
IOR
2006
177views more  IOR 2006»
13 years 4 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
CONSTRAINTS
2010
101views more  CONSTRAINTS 2010»
13 years 4 months ago
Evaluating the impact of AND/OR search on 0-1 integer linear programming
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...
Radu Marinescu 0002, Rina Dechter