{"@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/Q732886","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q732886","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q732886","kernelVersion":"v1","immutable":true,"modified":"2026-01-15T04:25:44Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q732886","name":"A new heuristic to solve the one-warehouse \\(N\\)-retailer problem","headline":"A new heuristic to solve the one-warehouse \\(N\\)-retailer problem","description":"scientific article; zbMATH DE number 5615434","url":"https://portal.mardi4nfdi.de/entity/Q732886","datePublished":"2009-10-15","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q732884"},{"@id":"https://portal.mardi4nfdi.de/entity/Q732885"},{"@id":"https://portal.mardi4nfdi.de/entity/Q275044"},{"@id":"https://portal.mardi4nfdi.de/entity/Q189054"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q162215"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.COR.2009.04.012","url":"https://doi.org/10.1016/J.COR.2009.04.012"},"sameAs":["https://doi.org/10.1016/J.COR.2009.04.012"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5358751"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5663616"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3724059"}]},"provenance":{"prov:generatedAtTime":"2026-01-15T04:25:44Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}