liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A combinatorial optimization model for enterprise patent transfer
Wuhan Engineering Consulting Bureau, Wuhan, China.
Faculty of TechnologyUniversity of Vaasa, Vaasa, Finland.
Faculty of TechnologyUniversity of Vaasa, Vaasa, Finland.ORCID iD: 0000-0001-8006-3236
Old Dominion University, Norfolk, USA.
2015 (English)In: Journal of Special Topics in Information Technology and Management, ISSN 1385-951X, E-ISSN 1573-7667, Vol. 16, no 4, 327-337 p.Article in journal (Refereed) Published
Abstract [en]

Enterprises need patent transfer strategies to improve their technology management. This paper proposes a combinatorial optimization model that is based on intelligent computing to support enterprises’ decision making in developing patent transfer strategy. The model adopts the Black–Scholes Option Pricing Model and Arbitrage Pricing Theory to estimate a patent’s value. Based on the estimation, a hybrid genetic algorithm is applied that combines genetic algorithms and greedy strategy for the optimization purpose. Encode repairing and a single-point crossover are applied as well. To validate this proposed model, a case study is conducted. The results indicate that the proposed model is effective for achieving optimal solutions. The combinatorial optimization model can help enterprise promote their benefits from patent sale and support the decision making process when enterprises develop patent transfer strategies.

Place, publisher, year, edition, pages
Springer, 2015. Vol. 16, no 4, 327-337 p.
Keyword [en]
Optimization model, Knapsack problem 01, Black–Scholes Option Pricing Model, Arbitrage Pricing Theory, Genetic algorithms, Greedy strategy, Patent transfer
National Category
Algebra and Logic Mathematical Analysis Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-133461DOI: 10.1007/s10799-014-0207-zOAI: oai:DiVA.org:liu-133461DiVA: diva2:1060487
Available from: 2016-12-28 Created: 2016-12-28 Last updated: 2016-12-28Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Liu, Yang
In the same journal
Journal of Special Topics in Information Technology and Management
Algebra and LogicMathematical AnalysisComputer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 39 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf