<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-31-2995-1791686392</doi_batch_id>
  <timestamp>20261011023952</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>International Journal of Advances in Applied Computational Intelligence</full_title>
    <abbrev_title>IJAACI</abbrev_title>
    <issn media_type="electronic">2833-5600</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2024</year>
    </publication_date>
    <journal_volume>
     <volume>6</volume>
    </journal_volume>
    <issue>1</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>On Two New Algorithms for Solving Mixed Integer Linear Programming Problems and Their Applications</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Taher Ahmed</given_name>
      <surname>Jubbori</surname>
      <affiliations>
       <institution>
        <institution_name>Computer Techniques Engineering Department, Al-Mustaqbal University, Babil, Iraq</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>The objective of this paper is to introduce two new algorithms for dealing with mixed integer linear programming problems, where the first method will be applied to get the efficient cut in the standard cutting plane procedure to obtain the same optimal solution. The second method will be applied with many special conditions to get the global solution instead of the local solution by using cutting-plane and other famous algorithms. On the other hand, we compare our results to the other obtained results by applying other algorithms.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2024</year>
    </publication_date>
    <pages>
     <first_page>62</first_page>
     <last_page>73</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">2995</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/IJAACI.060106</doi>
     <resource>https://www.americaspg.com/journal/31/article/2995</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://www.americaspg.com/storage/41720348831.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
