{"id":"https://openalex.org/W2188263154","doi":null,"title":"Strip Packing Heuristics for the DAGs Packing Problem","display_name":"Strip Packing Heuristics for the DAGs Packing Problem","alternate_titles":[],"publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2188263154","mag":"2188263154"},"language":"en","primary_location":{"id":"mag:2188263154","doi":null,"is_oa":false,"landing_page_url":"http://www.din.uem.br/sbpo/sbpo2012/pdf/arq0428.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2188263154"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043528531","display_name":"Eduardo Theodoro Bogue","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eduardo Theodoro Bogue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034422755","display_name":"Ricardo Ribeiro dos Santos","orcid":"https://orcid.org/0000-0002-2955-8011","observed_orcids":["https://orcid.org/0000-0002-2955-8011"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ricardo Santos","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2955-8011","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072982737","display_name":"Edna A. Hoshino","orcid":"https://orcid.org/0000-0002-0836-4058","observed_orcids":["https://orcid.org/0000-0002-0836-4058"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Edna A. Hoshino","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-0836-4058","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022360951","display_name":"R. Souza de Oliveira","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Souza de Oliveira","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013580800","display_name":"Hilda Alves","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hilda Alves","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.948199987411499,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.948199987411499,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.015300000086426735,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.008700000122189522,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/strip-packing","display_name":"strip packing","score":0.7020000219345093},{"id":"https://openalex.org/keywords/subgraph-isomorphism","display_name":"subgraph isomorphism","score":0.8809999823570251},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.996999979019165},{"id":"https://openalex.org/keywords/heuristics","display_name":"heuristics","score":0.7509999871253967},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.7670000195503235},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"graph isomorphism","score":0.6340000033378601}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8638991117477417},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.7868905067443848},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.716994047164917},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6823098063468933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5648226737976074},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5634837746620178},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.44371718168258667},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3943098187446594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3560735583305359},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33060309290885925},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29162687063217163},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.08572006225585938},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.06459516286849976},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2188263154","doi":null,"is_oa":false,"landing_page_url":"http://www.din.uem.br/sbpo/sbpo2012/pdf/arq0428.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1491178396","https://openalex.org/W1597512615","https://openalex.org/W1705301328","https://openalex.org/W1973019085","https://openalex.org/W2011039300","https://openalex.org/W2019318803","https://openalex.org/W2046697882","https://openalex.org/W2066671865","https://openalex.org/W2102038674","https://openalex.org/W2140408662"],"related_works":["https://openalex.org/W2921132817","https://openalex.org/W2114935764","https://openalex.org/W4308499161","https://openalex.org/W2810934225","https://openalex.org/W2774703813","https://openalex.org/W2154230240","https://openalex.org/W2145195823","https://openalex.org/W2915191059","https://openalex.org/W7100212865"],"abstract_inverted_index":{"Consider":[0],"two":[1],"input":[2],"graphs":[3,70],"G1":[4,13,84],"and":[5,18,24,85,96,124,134],"G2":[6,19,35,55,86],"for":[7,54,99],"a":[8,30,51,60],"subgraph":[9,31,61],"isomorphism":[10,62],"procedure":[11,63],"where":[12,64],"is":[14,20,27,37],"the":[15,21,25,47,65,82,100,107,115],"small":[16],"graph":[17,23],"large":[22],"goal":[26],"to":[28,39,56,119],"nd":[29],"G":[32],"0":[33],"of":[34,49,59,117],"which":[36],"isomorphic":[38],"G1.":[40],"In":[41,81],"this":[42,74],"work":[43],"we":[44],"deal":[45],"with":[46],"problem":[48,75],"nding":[50],"minimum":[52],"size":[53],"be":[57],"part":[58],"inputs":[66],"are":[67,87,104],"directed":[68],"acyclic":[69],"(DAGs).":[71],"We":[72,89],"named":[73],"as":[76],"DAGs":[77,121],"Packing":[78,109],"Problem":[79],"(DPP).":[80],"DPP,":[83],"DAGs.":[88],"have":[90],"adopted":[91],"an":[92],"integer":[93],"linear":[94],"formulation":[95],"designed":[97],"heuristics":[98,103,118,127],"problem.":[101,110],"The":[102,111],"based":[105],"on":[106],"Strip":[108],"results":[112],"show":[113],"that":[114],"combination":[116],"convert":[120],"into":[122],"rectangles":[123],"strip":[125,132],"packing":[126],"provide":[128],"good":[129],"solutions":[130],"(minimum":[131],"size)":[133],"best":[135],"performance.":[136]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2188263154","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
