{"@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/Q1295064","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1295064","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1295064","kernelVersion":"v1","immutable":true,"modified":"2025-12-25T09:51:21Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1295064","name":"A search control for scheduling problems","headline":"A search control for scheduling problems","description":"scientific article; zbMATH DE number 1325677","url":"https://portal.mardi4nfdi.de/entity/Q1295064","datePublished":"2000-04-04","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q202536"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q161901"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0005-1098(98)80003-4","url":"https://doi.org/10.1016/S0005-1098(98)80003-4"},"sameAs":["https://doi.org/10.1016/S0005-1098(98)80003-4"]},"provenance":{"prov:generatedAtTime":"2025-12-25T09:51:21Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}