%0 Conference Paper %1 conf/cp/Leyton-BrownNS02 %A Leyton-Brown, Kevin %A Nudelman, Eugene %A Shoham, Yoav %B CP %D 2002 %E Hentenryck, Pascal Van %I Springer %K dblp %P 556-572 %T Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. %U http://dblp.uni-trier.de/db/conf/cp/cp2002.html#Leyton-BrownNS02 %V 2470 %@ 3-540-44120-4

@inproceedings{conf/cp/Leyton-BrownNS02, added-at = {2019-06-02T00:00:00.000+0200}, author = {Leyton-Brown, Kevin and Nudelman, Eugene and Shoham, Yoav}, biburl = {https://www.bibsonomy.org/bibtex/2b958bd86b8d83dc31b77e5c6284dfaf7/dblp}, booktitle = {CP}, crossref = {conf/cp/2002}, editor = {Hentenryck, Pascal Van}, ee = {https://www.wikidata.org/entity/Q60521698}, interhash = {70a158dca3510db779294db4f139629a}, intrahash = {b958bd86b8d83dc31b77e5c6284dfaf7}, isbn = {3-540-44120-4}, keywords = {dblp}, pages = {556-572}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-06-04T13:20:12.000+0200}, title = {Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions.}, url = {http://dblp.uni-trier.de/db/conf/cp/cp2002.html#Leyton-BrownNS02}, volume = 2470, year = 2002 }