{"id":"https://openalex.org/W2012559977","doi":"https://doi.org/10.1007/s10878-013-9689-6","title":"Generating QAP instances with known optimum solution and additively decomposable cost function","display_name":"Generating QAP instances with known optimum solution and additively decomposable cost function","publication_year":2013,"publication_date":"2013-12-11","ids":{"openalex":"https://openalex.org/W2012559977","doi":"https://doi.org/10.1007/s10878-013-9689-6","mag":"2012559977"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-013-9689-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9689-6","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/files/11369078/DruganGenerating2015.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016131956","display_name":"M\u0103d\u0103lina M. Drugan","orcid":"https://orcid.org/0000-0001-9497-3134"},"institutions":[{"id":"https://openalex.org/I13469542","display_name":"Vrije Universiteit Brussel","ror":"https://ror.org/006e5kg04","country_code":"BE","type":"education","lineage":["https://openalex.org/I13469542"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"M\u0103d\u0103lina M. Drugan","raw_affiliation_strings":["Computational Modeling Lab, Artificial Intelligence group, Department of Computer Science, Vrije Universiteit Brussel, Pleinlaan 2, 1050 , Brussels, Belgium","Computational Modeling Lab, Artificial Intelligence group, Department of Computer Science, Vrije Universiteit Brussel, Brussels, Belgium 1050#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computational Modeling Lab, Artificial Intelligence group, Department of Computer Science, Vrije Universiteit Brussel, Pleinlaan 2, 1050 , Brussels, Belgium","institution_ids":["https://openalex.org/I13469542"]},{"raw_affiliation_string":"Computational Modeling Lab, Artificial Intelligence group, Department of Computer Science, Vrije Universiteit Brussel, Brussels, Belgium 1050#TAB#","institution_ids":["https://openalex.org/I13469542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016131956"],"corresponding_institution_ids":["https://openalex.org/I13469542"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":null,"fwci":3.3208,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.91355088,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"4","first_page":"1138","last_page":"1172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973000288009644,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9969000220298767,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8519071936607361},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5610748529434204},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5355173945426941},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5029436945915222},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4822045564651489},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4748696982860565},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46812546253204346},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.4216774106025696},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.41970834136009216},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.4109095633029938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.386311411857605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3777002692222595},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33702537417411804},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2791939377784729},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10656240582466125},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.0742013156414032}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8519071936607361},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5610748529434204},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5355173945426941},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5029436945915222},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4822045564651489},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4748696982860565},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46812546253204346},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.4216774106025696},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.41970834136009216},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.4109095633029938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.386311411857605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3777002692222595},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33702537417411804},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2791939377784729},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10656240582466125},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0742013156414032},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/s10878-013-9689-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-013-9689-6","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:publications/77590c77-5e6d-4252-9ed8-856cadae6601","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/77590c77-5e6d-4252-9ed8-856cadae6601","pdf_url":"https://research.tue.nl/files/11369078/DruganGenerating2015.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drugan, M M 2015, 'Generating QAP instances with known optimum solution and additively decomposable cost function', Journal of Combinatorial Optimization, vol. 30, no. 4, pp. 1138-1172. https://doi.org/10.1007/s10878-013-9689-6","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/77590c77-5e6d-4252-9ed8-856cadae6601","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/77590c77-5e6d-4252-9ed8-856cadae6601","pdf_url":"https://research.tue.nl/nl/publications/77590c77-5e6d-4252-9ed8-856cadae6601","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 30(4), 1138 - 1172. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:838295","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=838295","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:889682","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=889682","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:838295","is_oa":false,"landing_page_url":"http://repository.tue.nl/838295","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:889682","is_oa":false,"landing_page_url":"http://repository.tue.nl/889682","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:vubissmart:VUBISSMART:2000:86103","is_oa":false,"landing_page_url":"https://biblio.vub.ac.be/vubir/generating-qap-instances-with-known-optimum-solution-and-additively-decomposable-cost-function(1c613736-a8c3-4813-9647-43b407327976).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306402573","display_name":"VUBIR (Vrije Universiteit Brussel)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I13469542","host_organization_name":"Vrije Universiteit Brussel","host_organization_lineage":["https://openalex.org/I13469542"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:publications/77590c77-5e6d-4252-9ed8-856cadae6601","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/77590c77-5e6d-4252-9ed8-856cadae6601","pdf_url":"https://research.tue.nl/files/11369078/DruganGenerating2015.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Drugan, M M 2015, 'Generating QAP instances with known optimum solution and additively decomposable cost function', Journal of Combinatorial Optimization, vol. 30, no. 4, pp. 1138-1172. https://doi.org/10.1007/s10878-013-9689-6","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2012559977.pdf","grobid_xml":"https://content.openalex.org/works/W2012559977.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W19016451","https://openalex.org/W181871714","https://openalex.org/W1495804950","https://openalex.org/W1503085769","https://openalex.org/W1531770108","https://openalex.org/W1539664248","https://openalex.org/W1542159644","https://openalex.org/W1874649147","https://openalex.org/W1964357023","https://openalex.org/W1971700807","https://openalex.org/W1998981559","https://openalex.org/W2013603106","https://openalex.org/W2015206516","https://openalex.org/W2020696014","https://openalex.org/W2035338482","https://openalex.org/W2049299385","https://openalex.org/W2061494390","https://openalex.org/W2080178200","https://openalex.org/W2098677716","https://openalex.org/W2107454643","https://openalex.org/W2121035504","https://openalex.org/W2165739754","https://openalex.org/W4230109265"],"related_works":["https://openalex.org/W2242098268","https://openalex.org/W4244945894","https://openalex.org/W2760515006","https://openalex.org/W2802042052","https://openalex.org/W1987609185","https://openalex.org/W2003462717","https://openalex.org/W4224881918","https://openalex.org/W174828583","https://openalex.org/W2059098648","https://openalex.org/W2060252799"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3}],"updated_date":"2026-09-01T08:31:24.195828","created_date":"2025-10-10T00:00:00"}