Branch-and-cut algorithms for winner determination in discount auctions (Q3079182)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5859275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-cut algorithms for winner determination in discount auctions |
scientific article; zbMATH DE number 5859275 |
Statements
1 March 2011
0 references
discount auctions
0 references
integer programming
0 references
linear relaxation
0 references
valid inequalities
0 references
branch-and-cut
0 references
transportation problem
0 references
0.9333806037902832
0 references
0.7697810530662537
0 references
0.7674630284309387
0 references
0.7660126090049744
0 references
0.7562849521636963
0 references
