Winner determination algorithms for combinatorial auctions with sub-cardinality constraints
Year of publication: |
March 2016
|
---|---|
Authors: | Garcia, Christopher |
Published in: |
Computational economics. - Dordrecht [u.a.] : Springer, ISSN 0927-7099, ZDB-ID 1142021-2. - Vol. 47.2016, 3, p. 401-421
|
Subject: | Combinatorial auction | Proximity bidding | Integer programming | Simulated annealing | Meta-RaPS | Combinatorial optimization | Auktionstheorie | Auction theory | Ganzzahlige Optimierung | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Auction-based algorithm for solving scheduling problem in cross-docking centres
Paul, Eldho, (2020)
- More ...
-
Dynamic resource allocation and coordination for high-load crisis volunteer management
Garcia, Christopher, (2018)
-
Exact and approximate methods for parallel mulitple-area spatial scheduling with release times
Garcia, Christopher, (2013)
-
Practice summary : managing capacity at the University of Mary Washington's College of Business
Garcia, Christopher, (2019)
- More ...