{"id":"https://openalex.org/W2062144253","doi":"https://doi.org/10.1016/0305-0548(94)90084-1","title":"On combined minmax-minsum optimization","display_name":"On combined minmax-minsum optimization","publication_year":1994,"publication_date":"1994-07-01","ids":{"openalex":"https://openalex.org/W2062144253","doi":"https://doi.org/10.1016/0305-0548(94)90084-1","mag":"2062144253"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(94)90084-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90084-1","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/A5079361771","display_name":"Abraham P. Punnen","orcid":"https://orcid.org/0000-0002-3859-9229"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Abraham P. Punnen","raw_affiliation_strings":["Faculty of Administration, University of New Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada E3B 5A3","Faculty of Administration, University of new Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada E3B 5A3"],"affiliations":[{"raw_affiliation_string":"Faculty of Administration, University of New Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada E3B 5A3","institution_ids":["https://openalex.org/I106938459"]},{"raw_affiliation_string":"Faculty of Administration, University of new Brunswick, P.O. Box 4400, Fredericton, New Brunswick, Canada E3B 5A3","institution_ids":["https://openalex.org/I106938459"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079361771"],"corresponding_institution_ids":["https://openalex.org/I106938459"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.4655,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.64176145,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"6","first_page":"707","last_page":"716"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9979000091552734,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976000189781189,"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/minimax","display_name":"Minimax","score":0.8205288648605347},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.7542381882667542},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7187582850456238},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6876242160797119},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5620020627975464},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5239253640174866},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.518971860408783},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.4680953323841095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41947564482688904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41816872358322144},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.34224000573158264},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06825163960456848}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.8205288648605347},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7542381882667542},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7187582850456238},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6876242160797119},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5620020627975464},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5239253640174866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.518971860408783},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4680953323841095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41947564482688904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41816872358322144},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.34224000573158264},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06825163960456848},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0305-0548(94)90084-1","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(94)90084-1","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":12,"referenced_works":["https://openalex.org/W1441739641","https://openalex.org/W1968182342","https://openalex.org/W1987316423","https://openalex.org/W1996013403","https://openalex.org/W2013863738","https://openalex.org/W2020412470","https://openalex.org/W2028547116","https://openalex.org/W2029440362","https://openalex.org/W2053856707","https://openalex.org/W2069783012","https://openalex.org/W2090820749","https://openalex.org/W2478714993"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W2007464938","https://openalex.org/W2133667137","https://openalex.org/W2293098548","https://openalex.org/W2784100870","https://openalex.org/W2911215968","https://openalex.org/W2337360258","https://openalex.org/W4214624958","https://openalex.org/W2385011829","https://openalex.org/W1972615387"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}