{"@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/Q1296784","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1296784","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1296784","kernelVersion":"v1","immutable":true,"modified":"2025-07-16T21:13:34Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1296784","name":"4-block heuristic for the rectangle packing problem","headline":"4-block heuristic for the rectangle packing problem","description":"scientific article; zbMATH DE number 1320321","url":"https://portal.mardi4nfdi.de/entity/Q1296784","datePublished":"2001-10-21","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q315514"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1296783"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q62319"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0377-2217(96)00359-1","url":"https://doi.org/10.1016/S0377-2217(96)00359-1"},"sameAs":["https://doi.org/10.1016/S0377-2217(96)00359-1"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4896688"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3682228"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3337937"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3716813"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1197916"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1825761"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5681831"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4717141"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4018161"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3805803"}]},"provenance":{"prov:generatedAtTime":"2025-07-16T21:13:34Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}