{"@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/Q1850995","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1850995","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1850995","kernelVersion":"v1","immutable":true,"modified":"2025-07-25T05:10:38Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1850995","name":"Bounds and heuristics for the shortest capacitated paths problem","headline":"Bounds and heuristics for the shortest capacitated paths problem","description":"scientific article; zbMATH DE number 1845394","url":"https://portal.mardi4nfdi.de/entity/Q1850995","datePublished":"2002-12-15","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q411242"},{"@id":"https://portal.mardi4nfdi.de/entity/Q260023"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1850994"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q89111"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1023/A:1015492014030","url":"https://doi.org/10.1023/A:1015492014030"},"sameAs":["https://doi.org/10.1023/A:1015492014030"]},"provenance":{"prov:generatedAtTime":"2025-07-25T05:10:38Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}