{"id":"https://openalex.org/W2004121289","doi":"https://doi.org/10.1007/s10589-005-3058-z","title":"A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms","display_name":"A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms","publication_year":2005,"publication_date":"2005-10-18","ids":{"openalex":"https://openalex.org/W2004121289","doi":"https://doi.org/10.1007/s10589-005-3058-z","mag":"2004121289"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-005-3058-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-005-3058-z","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5059609876","display_name":"Dmitry I. Belov","orcid":"https://orcid.org/0000-0001-7800-8959"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Dmitry I. Belov","raw_affiliation_strings":["Psychometric Research, Law School Admission Council, 662 Penn Street, Newtown, PA, 18940, USA","Psychometric Research, Law School Admission Council, Newtown, USA 18940#TAB#"],"affiliations":[{"raw_affiliation_string":"Psychometric Research, Law School Admission Council, 662 Penn Street, Newtown, PA, 18940, USA","institution_ids":[]},{"raw_affiliation_string":"Psychometric Research, Law School Admission Council, Newtown, USA 18940#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076048717","display_name":"Ronald D. Armstrong","orcid":"https://orcid.org/0000-0001-6991-4730"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ronald D. Armstrong","raw_affiliation_strings":["Rutgers, The State University of New Jersey, 180 University Avenue, Newark, NJ, 07102-1895, USA","Rutgers, The State University of New Jersey, Newark, USA 07102-1895"],"affiliations":[{"raw_affiliation_string":"Rutgers, The State University of New Jersey, 180 University Avenue, Newark, NJ, 07102-1895, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"Rutgers, The State University of New Jersey, Newark, USA 07102-1895","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059609876"],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.8428,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.77210024,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"33","issue":"2-3","first_page":"319","last_page":"332"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9886999726295471,"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"}},{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9882000088691711,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6876039505004883},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6681432723999023},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6070311069488525},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6064565777778625},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5228815078735352},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.49485963582992554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47643619775772095},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.45913296937942505},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4380643665790558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27716779708862305},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.16888362169265747},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06840670108795166},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.05666157603263855}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6876039505004883},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6681432723999023},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6070311069488525},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6064565777778625},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5228815078735352},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.49485963582992554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47643619775772095},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.45913296937942505},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4380643665790558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27716779708862305},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.16888362169265747},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06840670108795166},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.05666157603263855},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10589-005-3058-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-005-3058-z","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W31349019","https://openalex.org/W1484343014","https://openalex.org/W1505774453","https://openalex.org/W1577424881","https://openalex.org/W1589951597","https://openalex.org/W1968143987","https://openalex.org/W1975608659","https://openalex.org/W2001341021","https://openalex.org/W2002747011","https://openalex.org/W2011039300","https://openalex.org/W2013972417","https://openalex.org/W2046847300","https://openalex.org/W2048264819","https://openalex.org/W2050272710","https://openalex.org/W2053913299","https://openalex.org/W2054112279","https://openalex.org/W2069323107","https://openalex.org/W2082603400","https://openalex.org/W2110383956","https://openalex.org/W2120402168","https://openalex.org/W2122508855","https://openalex.org/W2126218710","https://openalex.org/W2131245595","https://openalex.org/W2151743009","https://openalex.org/W2157767869","https://openalex.org/W2505968561","https://openalex.org/W4242995941","https://openalex.org/W6679211977"],"related_works":["https://openalex.org/W2389899617","https://openalex.org/W2950474130","https://openalex.org/W4291309325","https://openalex.org/W1931020284","https://openalex.org/W4319942994","https://openalex.org/W4313469555","https://openalex.org/W2334636689","https://openalex.org/W2737452945","https://openalex.org/W2024470714","https://openalex.org/W1985899403"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}