"Learning the Empirical Hardness of Optimization Problems: The Case of ..."

Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham (2002)

> Home

Details and statistics

DOI: 10.1007/3-540-46135-3_37

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cp/Leyton-BrownNS02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cp/Leyton-BrownNS02
Kevin Leyton-Brown, Eugene Nudelman, Yoav Shoham:
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. CP 2002: 556-572

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.