Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions

DOI10.1007/11775096_35MaRDI QIDQ5434415zbMATH OpenOpenAlexFDO

Authors S. Kameshwaran, Lyes Benyoucef

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11775096_35

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Branch-and-cut algorithms for winner determination in discount auctions
• An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
• Optimal Order Allocation with Discount Pricing
• Exact algorithms for procurement problems under a total quantity discount structure
• Internet shopping with price sensitive discounts

Cited in

(4)

• An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
• Optimal pricing in iterative flexible combinatorial procurement auctions
• An optimization approach for winner determination problem considering transportation cost discounts
• Branch-and-cut algorithms for winner determination in discount auctions

This page was built for publication: Branch on Price: A Fast Winner Determination Algorithm for Discount Auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434415)