Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contracts
- 31 December 2005
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 39 (10) , 914-933
- https://doi.org/10.1016/j.trb.2004.11.003
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- OPTIMIZATION‐BASED PROCUREMENT FOR TRANSPORTATION SERVICESJournal of Business Logistics, 2003
- Combinatorial Auctions: A SurveyINFORMS Journal on Computing, 2003
- Combinatorial auctions using rule-based bidsDecision Support Systems, 2002
- Preference elicitation in combinatorial auctionsPublished by Association for Computing Machinery (ACM) ,2001
- Mutually Destructive Bidding: The FCC Auction Design ProblemJournal of Regulatory Economics, 2000
- On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time WindowsOperations Research, 1997
- Chapter 2 Time constrained routing and schedulingPublished by Elsevier ,1995
- Chapter 1 Vehicle routingPublished by Elsevier ,1995
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- Set Partitioning: A surveySIAM Review, 1976