{"id":"https://openalex.org/W273302678","doi":null,"title":"Multicriteria integer zero-one programming : a tree-search type algorithm.","display_name":"Multicriteria integer zero-one programming : a tree-search type algorithm.","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W273302678","mag":"273302678"},"language":"en","primary_location":{"id":"pmh:ADA050244","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA050244","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"DTIC AND NTIS","raw_type":"Text"},"volume":null,"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/A5069477461","display_name":"Aggelos Konstantinou Simopoulos","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aggelos Konstantinou Simopoulos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5069477461"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.8925999999046326,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.8925999999046326,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.07069999724626541,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.019899999722838402,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/zero-one-programming","display_name":"zero-one integer programming","score":0.9110000133514404},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.9620000123977661},{"id":"https://openalex.org/keywords/pareto-optimal-solutions","display_name":"Pareto optimal solutions","score":0.7329999804496765},{"id":"https://openalex.org/keywords/tree-search","display_name":"tree search","score":0.7889999747276306},{"id":"https://openalex.org/keywords/implicit-enumeration","display_name":"implicit enumeration","score":0.9539999961853027},{"id":"https://openalex.org/keywords/variable-partitioning","display_name":"variable partitioning","score":0.9150000214576721},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.6959999799728394}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7305938601493835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5466467142105103},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5410465598106384},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.5341680645942688},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5340268611907959},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.503872811794281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4833778738975525},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4678742587566376},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.4459555149078369},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4133707880973816},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3302260637283325},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22071686387062073},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15776321291923523},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10814046859741211},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:ADA050244","doi":null,"is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA050244","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:calhoun.nps.edu:10945/18210","doi":null,"is_oa":false,"landing_page_url":"https://hdl.handle.net/10945/18210","pdf_url":null,"source":{"id":"https://openalex.org/S4306400952","display_name":"Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I35364215","host_organization_name":"Naval Postgraduate School","host_organization_lineage":["https://openalex.org/I35364215"],"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":"Thesis"},{"id":"mag:273302678","doi":null,"is_oa":false,"landing_page_url":"https://calhoun.nps.edu/bitstream/10945/18210/1/multicriteriaint00simo.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":5,"referenced_works":["https://openalex.org/W1607759612","https://openalex.org/W2002988497","https://openalex.org/W2007645463","https://openalex.org/W2038614136","https://openalex.org/W2222311877"],"related_works":["https://openalex.org/W65204789","https://openalex.org/W1997797636","https://openalex.org/W2065262885","https://openalex.org/W2039987877","https://openalex.org/W2016131362","https://openalex.org/W2023269357","https://openalex.org/W2614081091","https://openalex.org/W1972863585","https://openalex.org/W6903587864","https://openalex.org/W2076756604"],"abstract_inverted_index":{"An":[0],"algorithm":[1,103],"for":[2],"zero-one":[3],"integer":[4],"programming":[5],"problems":[6],"with":[7,29,54,62],"more":[8],"than":[9],"one":[10,67],"objective":[11,58,87],"functions":[12,59,88],"is":[13,35,108],"developed,":[14],"implemented":[15],"and":[16,45,60,95,110],"tested.":[17],"For":[18],"a":[19],"multiobjective":[20],"problem":[21,75],"the":[22,43,71,74,86,92,96],"notion":[23],"of":[24,31,68,91],"optimality":[25],"must":[26],"be":[27,38],"replaced":[28],"that":[30],"efficiency.":[32],"A":[33,98],"solution":[34,48],"said":[36],"to":[37,56,64],"efficient":[39],"if":[40],"it":[41],"satisfies":[42],"constraints":[44],"no":[46],"other":[47],"satisfying":[49],"them":[50],"scores":[51],"as":[52],"well":[53],"respect":[55,63],"all":[57,90],"better":[61],"at":[65],"least":[66],"them.":[69],"In":[70],"presented":[72],"algorithm,":[73],"variables":[76],"are":[77,89,113],"partitioned":[78],"into":[79],"two":[80],"sets;":[81],"those":[82],"whose":[83],"coefficients":[84],"in":[85],"same":[93],"sign,":[94],"remainder.":[97],"tree":[99],"search":[100],"implicit":[101],"enumeration":[102],"based":[104],"on":[105],"this":[106],"partition":[107],"developed":[109],"computational":[111],"results":[112],"presented.":[114],"(Author)":[115]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2016-06-24T00:00:00"}