{"id":"https://openalex.org/W2091110084","doi":"https://doi.org/10.1016/s0305-0548(03)00020-0","title":"Approximate algorithms for constrained circular cutting problems","display_name":"Approximate algorithms for constrained circular cutting problems","publication_year":2003,"publication_date":"2003-04-07","ids":{"openalex":"https://openalex.org/W2091110084","doi":"https://doi.org/10.1016/s0305-0548(03)00020-0","mag":"2091110084"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(03)00020-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00020-0","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5108466060","display_name":"Mhand Hifi","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I51101395","display_name":"Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne","ror":"https://ror.org/002t25c44","country_code":"FR","type":"education","lineage":["https://openalex.org/I51101395"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Mhand Hifi","raw_affiliation_strings":["CERMSEM-CNRS UMR 8095, Maison des Sciences Economiques, Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne, 106-112, Boulevard de l'H\u00f4pital, Paris 75647, Cedex 13, France","LaRIA, Laboratoire de Recherche en Informatique d'Amiens, 5 rue du Moulin Neuf, Amiens 80000, France"],"affiliations":[{"raw_affiliation_string":"CERMSEM-CNRS UMR 8095, Maison des Sciences Economiques, Universit\u00e9 Paris 1 Panth\u00e9on-Sorbonne, 106-112, Boulevard de l'H\u00f4pital, Paris 75647, Cedex 13, France","institution_ids":["https://openalex.org/I51101395","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"LaRIA, Laboratoire de Recherche en Informatique d'Amiens, 5 rue du Moulin Neuf, Amiens 80000, France","institution_ids":["https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076485787","display_name":"Rym M\u2019Hallah","orcid":"https://orcid.org/0000-0001-6775-7276"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rym M'Hallah","raw_affiliation_strings":["Department of Quantitative Methods and Information Technologies, Institut Sup\u00e9rieur de Gestion de Sousse, B.P. 763, Sousse 4000, Tunisia"],"affiliations":[{"raw_affiliation_string":"Department of Quantitative Methods and Information Technologies, Institut Sup\u00e9rieur de Gestion de Sousse, B.P. 763, Sousse 4000, Tunisia","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108466060"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210144804","https://openalex.org/I51101395"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":4.6425,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.94155752,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"31","issue":"5","first_page":"675","last_page":"694"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9998999834060669,"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.9998999834060669,"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.9950000047683716,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/packing-problems","display_name":"Packing problems","score":0.7435706257820129},{"id":"https://openalex.org/keywords/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.6754149198532104},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6689549684524536},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6215482950210571},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5553735494613647},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5452746152877808},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5408987402915955},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5088672637939453},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5045698881149292},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4793025553226471},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44893747568130493},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4299914538860321},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.4228290319442749},{"id":"https://openalex.org/keywords/scope","display_name":"Scope (computer science)","score":0.41191691160202026},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3218468427658081}],"concepts":[{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.7435706257820129},{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.6754149198532104},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6689549684524536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6215482950210571},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5553735494613647},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5452746152877808},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5408987402915955},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5088672637939453},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5045698881149292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4793025553226471},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44893747568130493},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4299914538860321},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.4228290319442749},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.41191691160202026},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3218468427658081},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(03)00020-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(03)00020-0","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W86853770","https://openalex.org/W652309760","https://openalex.org/W1482236382","https://openalex.org/W1497256448","https://openalex.org/W1559215823","https://openalex.org/W1568834902","https://openalex.org/W1971724331","https://openalex.org/W1985037416","https://openalex.org/W2016207616","https://openalex.org/W2016929496","https://openalex.org/W2018182024","https://openalex.org/W2049419174","https://openalex.org/W2051575955","https://openalex.org/W2058618345","https://openalex.org/W2081874143","https://openalex.org/W2086775375","https://openalex.org/W2090600331","https://openalex.org/W2128665168","https://openalex.org/W2153774705","https://openalex.org/W2162530405","https://openalex.org/W4211218975","https://openalex.org/W6655006269"],"related_works":["https://openalex.org/W2111448234","https://openalex.org/W4309468884","https://openalex.org/W2046282805","https://openalex.org/W3134980951","https://openalex.org/W67104275","https://openalex.org/W2000566382","https://openalex.org/W1536326961","https://openalex.org/W1983494426","https://openalex.org/W2981809403","https://openalex.org/W2058038705"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":14}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}