A branch-and-cut algorithm for the Winner Determination Problem

被引：18
|
作者：
Escudero, Laureano F. [1 ]
Landete, Mercedes [1 ]
Marin, Alfredo [1 ]
机构：
[1] Univ Murcia, Dept Estadist & Invest Operat, E-30001 Murcia, Spain
来源：
DECISION SUPPORT SYSTEMS | 2009年 / 46卷 / 03期
关键词：
Combinatorial auctions; Set packing; Valid inequalities; COMBINATORIAL AUCTIONS;
D O I：
10.1016/j.dss.2008.10.009
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Winner Determination Problem is the problem of maximizing the benefit when bids can be made on a group of items. in this paper, we consider the set packing formulation of the problem, study its polyhedral structure and then propose a new and tighter formulation. We also present new valid inequalities which are generated by exploiting combinatorial auctions peculiarities. Finally, we implement a branch-and-cut algorithm which shows its efficiency in a big number of instances. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码：649 / 659
页数：11
相关论文
共 50 条
  • [1] Branch-and-cut algorithm for the equicut problem
    Universita degli Studi di Padova, Padova, Italy
    [J]. Math Program Ser B, 2 (243-263):
  • [2] A branch-and-cut algorithm for the equicut problem
    Brunetta, L
    Conforti, M
    Rinaldi, G
    [J]. MATHEMATICAL PROGRAMMING, 1997, 78 (02) : 243 - 263
  • [3] A branch-and-cut algorithm for the equicut problem
    Lorenzo Brunetta
    Michele Conforti
    Giovanni Rinaldi
    [J]. Mathematical Programming, 1997, 78 : 243 - 263
  • [4] A branch-and-cut algorithm for the preemptive swapping problem
    Bordenave, Charles
    Gendreau, Michel
    Laporte, Gilbert
    [J]. NETWORKS, 2012, 59 (04) : 387 - 399
  • [5] A branch-and-cut algorithm for an assembly routing problem
    Chitsaz, Masoud
    Cordeau, Jean-Francois
    Jans, Raf
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 282 (03) : 896 - 910
  • [6] A branch-and-cut algorithm for the Team Orienteering Problem
    Bianchessi, Nicola
    Mansini, Renata
    Speranza, M. Grazia
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2018, 25 (02) : 627 - 635
  • [7] A branch-and-cut algorithm for the target visitation problem
    Hildenbrandt, Achim
    [J]. EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2019, 7 (03) : 209 - 242
  • [8] A Branch-and-Cut Algorithm for the Nonpreemptive Swapping Problem
    Bordenave, Charles
    Gendreau, Michel
    Laporte, Gilbert
    [J]. NAVAL RESEARCH LOGISTICS, 2009, 56 (05) : 478 - 486
  • [9] A branch-and-cut algorithm for the pallet loading problem
    Alvarez-Valdes, R
    Parreño, F
    Tamarit, JM
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2005, 32 (11) : 3007 - 3029
  • [10] A branch-and-cut algorithm for the Edge Interdiction Clique Problem
    Furini, Fabio
    Ljubic, Ivana
    San Segundo, Pablo
    Zhao, Yanlu
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (01) : 54 - 69
12345