{"id":"https://openalex.org/W2744336177","doi":"https://doi.org/10.1007/s10601-018-9292-7","title":"Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem","display_name":"Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem","publication_year":2018,"publication_date":"2018-06-16","ids":{"openalex":"https://openalex.org/W2744336177","doi":"https://doi.org/10.1007/s10601-018-9292-7","mag":"2744336177"},"language":"en","primary_location":{"id":"doi:10.1007/s10601-018-9292-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10601-018-9292-7","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"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":"Constraints","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/186333","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054967843","display_name":"Vinas\u00e9tan Ratheil Houndji","orcid":"https://orcid.org/0000-0002-5467-9448"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vinasetan Ratheil Houndji","raw_affiliation_strings":["Institut de Formation et de Recherche en Informatique (IFRI, UAC), Abomey-Calavi, B\u00e9nin"],"raw_orcid":"https://orcid.org/0000-0002-5467-9448","affiliations":[{"raw_affiliation_string":"Institut de Formation et de Recherche en Informatique (IFRI, UAC), Abomey-Calavi, B\u00e9nin","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054967843"],"corresponding_institution_ids":[],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.01041911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"23","issue":"4","first_page":"481","last_page":"482"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.973800003528595,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.973800003528595,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6871184706687927},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5285595655441284},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5029227137565613},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48834559321403503},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.46956896781921387},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46830523014068604},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4481838047504425},{"id":"https://openalex.org/keywords/sizing","display_name":"Sizing","score":0.41263672709465027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3898588716983795},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.23918303847312927}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6871184706687927},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5285595655441284},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5029227137565613},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48834559321403503},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46956896781921387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46830523014068604},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4481838047504425},{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.41263672709465027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3898588716983795},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.23918303847312927},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10601-018-9292-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10601-018-9292-7","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"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":"Constraints","raw_type":"journal-article"},{"id":"pmh:oai:dial.uclouvain.be:boreal:186333","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/186333","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"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":"","raw_type":"info:eu-repo/semantics/doctoralThesis"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:186333","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/186333","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"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":"","raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2474680198","https://openalex.org/W2597689725","https://openalex.org/W2623227928","https://openalex.org/W2363855676","https://openalex.org/W1569102320","https://openalex.org/W4381955737","https://openalex.org/W2770186408","https://openalex.org/W4385652378","https://openalex.org/W2049828308","https://openalex.org/W2998274290"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}