Show simple item record

Can we measure the difficulty of an optimization problem?

contributor authorAlpcan, Tansu
contributor authorEveritt, Tom
contributor authorHutter, Marcus
date accessioned2020-03-12T22:01:02Z
date available2020-03-12T22:01:02Z
date issued2014
identifier other6970853.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/1068519?show=full
formatgeneral
languageEnglish
publisherIEEE
titleCan we measure the difficulty of an optimization problem?
typeConference Paper
contenttypeMetadata Only
identifier padid8203620
subject keywordsreactive power
subject keywordsn classic instantaneous reactive power theory
subject keywordsn nonsinusoidal power theories
subject keywordsn real data
subject keywordsn theoretical techniques
subject keywordsn Conferences
subject keywordsn Current measurement
subject keywordsn Equations
subject keywordsn Mathematical model
subject keywordsn Power measurement
subject keywordsn Reactive power
subject keywordsn Vectors
subject keywordsn &
subject keywords#x03B1
subject keywords-&
subject keywords#x03B2
subject keywordsplane
subject keywordsn instantaneous
subject keywordsn p-q theory
subject keywordsn power theory
identifier doi10.1109/ICHQP.2014.6842839
journal titlenformation Theory Workshop (ITW), 2014 IEEE
filesize265355
citations0


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record