{"@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/Q3157355","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q3157355","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q3157355","kernelVersion":"v1","immutable":true,"modified":"2026-01-04T14:49:23Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q3157355","name":"A branch and bound algorithm for locating input and output points of departments on the block layout","headline":"A branch and bound algorithm for locating input and output points of departments on the block layout","description":"scientific article; zbMATH DE number 2127413","url":"https://portal.mardi4nfdi.de/entity/Q3157355","datePublished":"2005-01-13","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1665666"},{"@id":"https://portal.mardi4nfdi.de/entity/Q204001"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3030552"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1057/PALGRAVE.JORS.2600720","url":"https://doi.org/10.1057/PALGRAVE.JORS.2600720"},"sameAs":["https://doi.org/10.1057/PALGRAVE.JORS.2600720"]},"provenance":{"prov:generatedAtTime":"2026-01-04T14:49:23Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}