<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Operations Research</title>
<title_fa>مجله انجمن ایرانی تحقیق در عملیات</title_fa>
<short_title>IJOR</short_title>
<subject>Basic Sciences</subject>
<web_url>http://iors.ir/journal</web_url>
<journal_hbi_system_id>0</journal_hbi_system_id>
<journal_hbi_system_user>user</journal_hbi_system_user>
<journal_id_issn>2008-1189</journal_id_issn>
<journal_id_issn_online></journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>10.29252/iors</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1391</year>
	<month>6</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2012</year>
	<month>9</month>
	<day>1</day>
</pubdate>
<volume>3</volume>
<number>2</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Robust Quadratic Assignment Problem with Uncertain Locations</title>
	<subject_fa></subject_fa>
	<subject></subject>
	<content_type_fa>پژوهشی</content_type_fa>
	<content_type>Original</content_type>
	<abstract_fa></abstract_fa>
	<abstract>
&lt;font size=&quot;3&quot;&gt;&lt;font face=&quot;Times New Roman&quot;&gt; &lt;/font&gt;&lt;span style=&quot;line-height: 115% font-size: 10pt&quot;&gt;&lt;em&gt;&lt;font face=&quot;tahoma,arial,helvetica,sans-serif&quot;&gt;We consider a generalization of the
classical quadratic assignment problem, where coordinates of locations are uncertain
and only upper and lower bounds are known for each coordinate. We develop a
mixed integer linear programming model as a robust counterpart of the proposed
uncertain model. A key challenge is that, since the uncertain model involves
nonlinear objective function of the uncertain data, classical robust
optimization approaches cannot be applied directly to construct its robust
counterpart. We exploit the problem structure to develop exact solution methods
and present some computational results.&lt;o:p /&gt;&lt;/font&gt;&lt;/em&gt;&lt;/span&gt;&lt;font face=&quot;Times New Roman&quot;&gt; &lt;/font&gt;&lt;/font&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Uncertainty modeling, Robustness and sensitivity analysis, Facilities planning and design, Quadratic assignment problem, Non-linear integer programming</keyword>
	<start_page>46</start_page>
	<end_page>65</end_page>
	<web_url>http://iors.ir/journal/browse.php?a_code=A-10-58-2&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name></first_name>
	<middle_name></middle_name>
	<last_name>Feizollahi</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>0003194753284600891</code>
	<orcid>0003194753284600891</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name></first_name>
	<middle_name></middle_name>
	<last_name>Modarres yazdi</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>0003194753284600892</code>
	<orcid>0003194753284600892</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
