Bid evaluation in procurement auctions with piecewise linear supply curves

DOI10.1007/s10732-005-0389-yzbMath1122.91321OpenAlexW2071339810MaRDI QIDQ2573006

Jayant R. Kalagnanam, Marta Eso, Laszlo Ladanyi, Soumyadip Ghosh

Publication date: 7 November 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-005-0389-y

zbMATH Keywords

column generationbranch-and-priceprocurement auctionsonline marketplaceslocal improvement heuristicsmulti-commodity auctionsrounding heuristics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items

Multiattribute electronic procurement using goal programming, Exact algorithms for procurement problems under a total quantity discount structure, Nonconvex piecewise linear knapsack problems, Impact of supply base heterogeneity in electronic markets, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

Uses Software

• LEDA
• CPLEX
• COIN-OR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Combinatorial Auctions: A Survey
• A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints
• A Branch-and-Price Algorithm for the Generalized Assignment Problem