Branch and Bound Heuristics for Multi-Unit Combinatorial Auctions: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:1204:12, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,156 bytes +2,156‎ Created page with "Title: Branch and Bound Heuristics for Multi-Unit Combinatorial Auctions Abstract: This research investigates the use of Branch-and-Bound techniques for finding optimal solutions in multi-unit combinatorial auctions. It discusses different methods for efficiently bounding from above the value of the best allocation and suggests the best ordering criterion that provides the best approximation ratio. The results provide theoretical insights into the effectiveness of these..."
Retrieved from "https://simplesci.org/wiki/Branch_and_Bound_Heuristics_for_Multi-Unit_Combinatorial_Auctions"