Articolul precedent |
Articolul urmator |
653 2 |
Ultima descărcare din IBN: 2020-11-25 12:10 |
SM ISO690:2012 TERZI, Dmitri. Construirea unei soluţii admisibile pentru problema comisvoiajorului şi verificarea condiţiei de optimalitate. In: Paradigme moderne în dezvoltarea economiei naţionale şi mondiale, 1-2 noiembrie 2019, Chisinău. Chişinău: Centrul Editorial-Poligrafic al USM, 2019, p. 13. ISBN 978-9975-142-57-1. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Paradigme moderne în dezvoltarea economiei naţionale şi mondiale 2019 | ||||||
Conferința "Paradigme moderne în dezvoltarea economiei naţionale şi mondiale" Chisinău, Moldova, 1-2 noiembrie 2019 | ||||||
|
||||||
Pag. 13-13 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The methods of constructing an admissible cyclic solution of the traveling salesman problem are considered. From the generated cyclic solutions, the best one is selected, which is used as the initial one for an approximate solution of the traveling salesman problem using a modification of the method of potential for solving transport problems. |
||||||
Cuvinte-cheie Traveling Salesman Problem, generating cyclic solutions, the method of potential |
||||||
|
Cerif XML Export
<?xml version='1.0' encoding='utf-8'?> <CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'> <cfResPubl> <cfResPublId>ibn-ResPubl-100335</cfResPublId> <cfResPublDate>2019</cfResPublDate> <cfStartPage>13</cfStartPage> <cfISBN>978-9975-142-57-1</cfISBN> <cfURI>https://ibn.idsi.md/ro/vizualizare_articol/100335</cfURI> <cfTitle cfLangCode='RO' cfTrans='o'>Construirea unei soluţii admisibile pentru problema comisvoiajorului şi verificarea condiţiei de optimalitate</cfTitle> <cfKeyw cfLangCode='RO' cfTrans='o'>Traveling Salesman Problem; generating cyclic solutions; the method of potential</cfKeyw> <cfAbstr cfLangCode='EN' cfTrans='o'><p>The methods of constructing an admissible cyclic solution of the traveling salesman problem are considered. From the generated cyclic solutions, the best one is selected, which is used as the initial one for an approximate solution of the traveling salesman problem using a modification of the method of potential for solving transport problems.</p></cfAbstr> <cfResPubl_Class> <cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId> <cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId> <cfStartDate>2019T24:00:00</cfStartDate> </cfResPubl_Class> <cfResPubl_Class> <cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId> <cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId> <cfStartDate>2019T24:00:00</cfStartDate> </cfResPubl_Class> <cfPers_ResPubl> <cfPersId>ibn-person-39324</cfPersId> <cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId> <cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId> <cfStartDate>2019T24:00:00</cfStartDate> </cfPers_ResPubl> </cfResPubl> <cfPers> <cfPersId>ibn-Pers-39324</cfPersId> <cfPersName_Pers> <cfPersNameId>ibn-PersName-39324-2</cfPersNameId> <cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId> <cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId> <cfStartDate>2019T24:00:00</cfStartDate> <cfFamilyNames>Terzi</cfFamilyNames> <cfFirstNames>Dmitri</cfFirstNames> </cfPersName_Pers> </cfPers> </CERIF>