{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2432887","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2432887","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2432887","kernelVersion":"v1","immutable":true,"modified":"2026-01-12T06:49:47Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2432887","name":"Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem","headline":"Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem","description":"scientific article; zbMATH DE number 5067645","url":"https://portal.mardi4nfdi.de/entity/Q2432887","datePublished":"2006-10-25","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q707145"},{"@id":"https://portal.mardi4nfdi.de/entity/Q322705"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q62319"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.EJOR.2005.05.027","url":"https://doi.org/10.1016/J.EJOR.2005.05.027"},"sameAs":["https://doi.org/10.1016/J.EJOR.2005.05.027"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3799835"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4888170"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2368298"},{"@id":"https://portal.mardi4nfdi.de/entity/Q707147"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1774631"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3818145"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4305756"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5510390"}]},"provenance":{"prov:generatedAtTime":"2026-01-12T06:49:47Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}