The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (2016)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1016/j.disopt.2015.09.003
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; ALGORITMOS; TEORIA DOS JOGOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Discrete Optimization
- ISSN: 1873-636X
- Volume/Número/Paginação/Ano: v. 22, p. 141-191, 2016
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: hybrid
- Licença: publisher-specific-oa
-
ABNT
FERNANDES, Cristina Gomes et al. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discrete Optimization, v. 22, p. 141-191, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.disopt.2015.09.003. Acesso em: 30 abr. 2024. -
APA
Fernandes, C. G., Ferreira, C. E., Franco, Á. J. P., & Schouery, R. C. S. (2016). The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discrete Optimization, 22, 141-191. doi:10.1016/j.disopt.2015.09.003 -
NLM
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem [Internet]. Discrete Optimization. 2016 ; 22 141-191.[citado 2024 abr. 30 ] Available from: https://doi.org/10.1016/j.disopt.2015.09.003 -
Vancouver
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem [Internet]. Discrete Optimization. 2016 ; 22 141-191.[citado 2024 abr. 30 ] Available from: https://doi.org/10.1016/j.disopt.2015.09.003 - The envy-free pricing problem and unit-demand markets
- Selfish square packing
- Prices of anarchy of selfish 2D bin packing games
- A polyhedral investigation of the LCS problem and a repetition-free variant
- Repetition-free longest common subsequence
- Repetition-free longest common subsequence
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
Informações sobre o DOI: 10.1016/j.disopt.2015.09.003 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
