Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/353462
Full metadata record
DC FieldValueLanguage
dc.contributor.CRUESPUNIVERSIDADE ESTADUAL DE CAMPINASpt_BR
dc.contributor.authorunicampSchouery, Rafael Crivellari Salibapt_BR
dc.typeArtigopt_BR
dc.titleApproximation algorithms for the max-buying problem with limited supplypt_BR
dc.contributor.authorFernandes, Cristina G.pt_BR
dc.contributor.authorSchouery, Rafael C. S.pt_BR
dc.subjectAlgoritmos de aproximaçãopt_BR
dc.subjectProgramação inteirapt_BR
dc.subject.otherlanguageInteger programmingpt_BR
dc.subject.otherlanguageApproximation algorithmspt_BR
dc.description.abstractWe consider the Max-Buying Problem with Limited Supply, in which there are n items, with (Formula presented.) copies of each item i, and m consumers such that each consumer b has a valuation (Formula presented.) for item i. The goal is to find a pricing ppt_BR
dc.relation.ispartofAlgorithmicapt_BR
dc.publisher.cityNew York, NYpt_BR
dc.publisher.countryEstados Unidospt_BR
dc.publisherSpringerpt_BR
dc.date.issued2018pt_BR
dc.date.monthofcirculationNov.pt_BR
dc.language.isoengpt_BR
dc.description.volume80pt_BR
dc.description.issuenumber11pt_BR
dc.description.firstpage2973pt_BR
dc.description.lastpage2992pt_BR
dc.rightsfechadopt_BR
dc.sourceSCOPUSpt_BR
dc.identifier.issn0178-4617pt_BR
dc.identifier.eissn1432-0541pt_BR
dc.identifier.doi10.1007/s00453-017-0364-7pt_BR
dc.identifier.urlhttps://link.springer.com/chapter/10.1007/978-3-642-54423-1_61pt_BR
dc.description.sponsorshipFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESPpt_BR
dc.description.sponsorshipCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQpt_BR
dc.description.sponsorship1FAPESP - FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULOpt_BR
dc.description.sponsorship1CNPQ - CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICOpt_BR
dc.description.sponsordocumentnumber2013/03447-6pt_BR
dc.description.sponsordocumentnumber2013/21744-8pt_BR
dc.description.sponsordocumentnumber2015/11937-9pt_BR
dc.description.sponsordocumentnumber308523/2012-1pt_BR
dc.description.sponsordocumentnumber308116/2016-0pt_BR
dc.date.available2021-01-04T13:11:24Z-
dc.date.accessioned2021-01-04T13:11:24Z-
dc.description.provenanceMade available in DSpace on 2021-01-04T13:11:24Z (GMT). No. of bitstreams: 1 2-s2.0-85028759705.pdf: 611294 bytes, checksum: e26a27b9191b9d77fe9f7c8c06b70e45 (MD5) Previous issue date: 2018en
dc.identifier.urihttp://repositorio.unicamp.br/jspui/handle/REPOSIP/353462-
dc.contributor.departmentDepartamento de Teoria da Computaçãopt_BR
dc.contributor.unidadeInstituto de Computaçãopt_BR
dc.identifier.source2-s2.0-85028759705pt_BR
dc.creator.orcid0000-0002-0472-4810pt_BR
dc.type.formArtigopt_BR
Appears in Collections:IC - Artigos e Outros Documentos

Files in This Item:
File SizeFormat 
2-s2.0-85028759705.pdf596.97 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.