Optimal solutions for multi-unit combinatorial auctions

Abstract

Article Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics Share on Authors: Rica Gonen School of Computer Science and Engineering, Hebrew University, Jerusalem 91904, Israel School of Computer Science and Engineering, Hebrew University, Jerusalem 91904, IsraelView Profile , Daniel Lehmann School of Computer Science and Engineering, Hebrew University, Jerusalem 91904, Israel School of Computer Science and Engineering, Hebrew University, Jerusalem 91904, IsraelView Profile Authors Info & Claims EC '00: Proceedings of the 2nd ACM conference on Electronic commerceOctober 2000 Pages 13–20https://doi.org/10.1145/352871.352873Online:17 October 2000Publication History 102citation538DownloadsMetricsTotal Citations102Total Downloads538Last 12 Months18Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access