A robust winner determination problem for combinatorial transportation auctions under uncertain shipment volumes
Authors:
- Nabila RemliNRNabila Remli
- Monia RekikMRMonia Rekik
- 1 October 2013
- journal article
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 35, 204-217
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Reputation-based winner determination problem for combinatorial transportation procurement auctionsJournal of the Operational Research Society, 2012
- Valuation of freight transportation contracts under uncertaintyTransportation Research Part E: Logistics and Transportation Review, 2011
- Robustness and duality in linear programmingJournal of the Operational Research Society, 2010
- A stochastic programming winner determination model for truckload procurement under shipment uncertaintyTransportation Research Part E: Logistics and Transportation Review, 2010
- Robust Linear Programming with Right-Hand-Side Uncertainty, Duality and Applications2008
- Combinatorial auctionsAnnals of Operations Research, 2007
- A carrier’s optimal bid generation problem in combinatorial auctions for transportation procurementTransportation Research Part E: Logistics and Transportation Review, 2007
- Approximation algorithms for the bid construction problem in combinatorial auctions for the procurement of freight transportation contractsTransportation Research Part B: Methodological, 2005
- Adjustable robust solutions of uncertain linear programsMathematical Programming, 2004
- Robust discrete optimization and network flowsMathematical Programming, 2003