References
- AlcalyREKlevorickAKA note on the dual prices of integer programsEconometrica19663420621410.2307/1909864
- BjørndalMJørnstenKAn analysis of a combinatorial auctionQuantitative Approaches to Distribution Logistics and Supply Chain Management. Lecture Notes in Economics and Mathematical Systems2002163176
- Borndörfer R (1998). Aspects of set packing, partitioning, and covering. PhD dissertation, Technical University of Berlin.
- BrewerPJDecentralized computation procurement and computational robustness in a smart marketEconom Theory199913419210.1007/s001990050242
- CapliceCGSheffiYOptimization-based procurement for transportation servicesJ Bus Log20032410912810.1002/j.2158-1592.2003.tb00048.x
- DelormeXGandibleuxXRodriguezJGRASP for set packing problemsEur J Opl Res200415356458010.1016/S0377-2217(03)00263-7
- DeMartini C, Kwasnica AM, Ledyard JO, Porter D (1999). A new and improved design for multiobject iterative auctions. Working Paper, California Institute of Technology.
- De VriesSVohraRCombinatorial auctions: A surveyInforms J Comput20031528430910.1287/ijoc.15.3.284.16077
- GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-completeness1979
- GomoryREBaumolWJInteger programming and pricingEconometrica19602852155010.2307/1910130
- GünlükOLadányiLde VriesSA branch-and-price algorithm and new test problems for spectrum auctionsMngt Sci20055139140410.1287/mnsc.1040.0332
- HarcheFThompsonGLThe column substraction algorithm: An exact method for solving weighted set covering, packing and partitioning problemsComput Opns Res19942168970510.1016/0305-0548(94)90083-3
- HoffmannKPadbergMWSolving airline crew scheduling problems by branch and cutMngt Sci19933965767210.1287/mnsc.39.6.657
- KwasnicaAMLedyardJOPorterDDeMartiniCA new and improved design for multi-object iterative auctionsMngt Sci20055141943410.1287/mnsc.1040.0334
- KwonRHAnandalingamGUngarLHIterative combinatorial auctions with bidder-determined combinationsMngt Sci20055140741810.1287/mnsc.1040.0335
- McMillanJSelling spectrum rightsJ Econom Perspect1994814516210.1257/jep.8.3.145
- MilgromPPutting auction theory to work: The simultaneous ascending auctionJ Polit Econom200010824527210.1086/262118
- Parkes DC (2001). Iterative combinatorial auctions: Achieving economic and computational efficiency. PhD dissertation, Department of Computer and Information Science, University of Pennsylvania.
- RassentiSJSmithVJBulfinRLA combinatorial auction mechanism for airport time slot allocationBell J Econom19821340241710.2307/3003463
- RothkopfMHPekečAHarstadRMComputationally manageable combinational auctionsMngt Sci1998441131114710.1287/mnsc.44.8.1131
- SandholmTSuriSGilpinALevineDCABOB: A fast optimal algorithm for winner determination in combinatorial auctionsMngt Sci20055137439010.1287/mnsc.1040.0336
- ScarfHEMathematical programming and economic theoryOpns Res19903837738510.1287/opre.38.3.377
- Sturmfels B (2004). Algebraic recipes for integer programming. In: Proceedings of Symposia in Applied Mathematics, vol. 61: . American Mathematical Society, pp 99–113.
- WilliamsHPDuality in mathematics and linear and integer programmingJ Optim Theory Appl19969025727810.1007/BF02189998
- WolseyLAInteger programming duality: Price functions and sensitivity analysisMath Program19812017319510.1007/BF01589344
- Wurmann PR and Wellman MP (1999). Equilibrium prices in bundle auctions. Working Paper, Artificial Intelligence Laboratory, The University of Michigan.
- XiaMKoehlerGJWhinstonABPricing combinatorial auctionsEur J Opl Res200415425127010.1016/S0377-2217(02)00678-1