{"id":"https://openalex.org/W2111714593","doi":"https://doi.org/10.1109/cec.2003.1299862","title":"Optimization heuristics for the combinatorial auction problem","display_name":"Optimization heuristics for the combinatorial auction problem","publication_year":2004,"publication_date":"2004-07-09","ids":{"openalex":"https://openalex.org/W2111714593","doi":"https://doi.org/10.1109/cec.2003.1299862","mag":"2111714593"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2003.1299862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071291558","display_name":"Michael Schwind","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Schwind","raw_affiliation_strings":["Department of Economics, Esp. Information Systems, Frankfurt am Main, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Economics, Esp. Information Systems, Frankfurt am Main, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034271521","display_name":"Tim Stockheim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. Stockheim","raw_affiliation_strings":["Department of Economics, Esp. Information Systems, Frankfurt am Main, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Economics, Esp. Information Systems, Frankfurt am Main, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035443886","display_name":"Franz Rothlauf","orcid":"https://orcid.org/0000-0003-3376-427X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Rothlauf","raw_affiliation_strings":["Dept. of Information Systems I Schloss, Mannheim, Germany"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Systems I Schloss, Mannheim, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071291558"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6039,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89550815,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":null,"first_page":"1588","last_page":"1595"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9911999702453613,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.8010518550872803},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7820598483085632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6944024562835693},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4876669645309448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37068891525268555},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34861549735069275},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16551733016967773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1642051339149475},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.14265766739845276}],"concepts":[{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.8010518550872803},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7820598483085632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6944024562835693},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4876669645309448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37068891525268555},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34861549735069275},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16551733016967773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1642051339149475},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.14265766739845276},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2003.1299862","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2003.1299862","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W226234260","https://openalex.org/W1487486353","https://openalex.org/W1491938051","https://openalex.org/W1518755039","https://openalex.org/W1526869991","https://openalex.org/W1608894626","https://openalex.org/W1639032689","https://openalex.org/W1912374697","https://openalex.org/W1953727931","https://openalex.org/W1992339380","https://openalex.org/W2011315427","https://openalex.org/W2013469527","https://openalex.org/W2017651866","https://openalex.org/W2023878779","https://openalex.org/W2024060531","https://openalex.org/W2056760934","https://openalex.org/W2110383956","https://openalex.org/W2119083120","https://openalex.org/W2137004940","https://openalex.org/W2138536735","https://openalex.org/W2140353857","https://openalex.org/W2168079536","https://openalex.org/W2336259629","https://openalex.org/W3023540311","https://openalex.org/W3165831389","https://openalex.org/W4251469839","https://openalex.org/W4253578691","https://openalex.org/W6629140435","https://openalex.org/W6630953734","https://openalex.org/W6677672180","https://openalex.org/W6680923002","https://openalex.org/W6796206129","https://openalex.org/W7070283312"],"related_works":["https://openalex.org/W2280422768","https://openalex.org/W3143197806","https://openalex.org/W4252555497","https://openalex.org/W3121175838","https://openalex.org/W3016293053","https://openalex.org/W2401723157","https://openalex.org/W2952904874","https://openalex.org/W324626582","https://openalex.org/W4389302559","https://openalex.org/W1690653314"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"and":[3,24,70,79],"compares":[4],"three":[5,52],"heuristics":[6,53],"for":[7,45,67],"the":[8,34,46,57,68,77,86,89,92,100,103,123,127,135,149,154,167],"combinatorial":[9,35],"auction":[10,36],"problem.":[11],"Besides":[12],"a":[13,20,25,60,113,119],"simple":[14,104,150],"greedy":[15,105,151],"(SG)":[16],"mechanism,":[17],"two":[18],"metaheuristics,":[19],"simulated":[21],"annealing":[22],"(SA),":[23],"genetic":[26],"algorithm":[27],"(GA)":[28],"approach":[29],"are":[30],"developed":[31],"which":[32],"use":[33],"process":[37,65],"to":[38,96,148,162],"find":[39],"an":[40],"allocation":[41,64,106],"with":[42],"maximal":[43],"revenue":[44],"auctioneer.":[47],"The":[48,108],"performance":[49,90,101],"of":[50,59,72,91,102,122,140],"these":[51],"is":[54,94,144,159],"evaluated":[55],"in":[56,118,131,138,146,166],"context":[58],"price":[61],"controlled":[62],"resource":[63],"designed":[66],"control":[69],"provision":[71],"distributed":[73],"information":[74],"services.":[75],"Comparing":[76],"SG":[78],"SA":[80,93],"method":[81],"shows":[82],"that":[83],"depending":[84],"on":[85],"problem":[87],"structure":[88],"up":[95],"20%":[97],"higher":[98,132,145],"than":[99],"method.":[107],"proposed":[109],"GA":[110],"approach,":[111],"using":[112],"random":[114],"key":[115],"encoding,":[116],"results":[117],"further":[120],"improvement":[121],"solution":[124],"quality.":[125],"Although":[126],"metaheuristic":[128],"approaches":[129],"result":[130],"search":[133],"performance,":[134],"computational":[136],"effort":[137],"terms":[139],"used":[141],"CPU":[142],"time":[143,158],"comparison":[147],"mechanism.":[152],"However,":[153],"absolute":[155],"overall":[156],"computation":[157],"low":[160],"enough":[161],"enable":[163],"real-time":[164],"execution":[165],"considered":[168],"IS":[169],"application":[170],"domain.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}