{"id":"https://openalex.org/W3207212991","doi":"https://doi.org/10.1007/s10107-021-01711-5","title":"Decreasing minimization on M-convex sets: algorithms and applications","display_name":"Decreasing minimization on M-convex sets: algorithms and applications","publication_year":2021,"publication_date":"2021-10-15","ids":{"openalex":"https://openalex.org/W3207212991","doi":"https://doi.org/10.1007/s10107-021-01711-5","mag":"3207212991"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-021-01711-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-021-01711-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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/A5091492325","display_name":"Andr\u00e1s Frank","orcid":"https://orcid.org/0000-0001-6161-4848"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Andr\u00e1s Frank","raw_affiliation_strings":["MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P. s. 1/c, 1117, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"MTA-ELTE Egerv\u00e1ry Research Group, Department of Operations Research, E\u00f6tv\u00f6s University, P\u00e1zm\u00e1ny P. s. 1/c, 1117, Budapest, Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032957138","display_name":"Kazuo Murota","orcid":"https://orcid.org/0000-0003-1518-9152"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kazuo Murota","raw_affiliation_strings":["Department of Economics and Business Administration, Tokyo Metropolitan University, Tokyo, 192-0397, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Economics and Business Administration, Tokyo Metropolitan University, Tokyo, 192-0397, Japan","institution_ids":["https://openalex.org/I69740276"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032957138"],"corresponding_institution_ids":["https://openalex.org/I69740276"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4522,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68764871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"195","issue":"1-2","first_page":"1027","last_page":"1068"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"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/matroid","display_name":"Matroid","score":0.8190528154373169},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.656811535358429},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.5254261493682861},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4363562762737274},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4273136258125305},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4161970615386963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40801069140434265},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3001290559768677}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8190528154373169},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.656811535358429},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.5254261493682861},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4363562762737274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4273136258125305},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4161970615386963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40801069140434265},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3001290559768677},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-021-01711-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-021-01711-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"Mathematical Programming","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":62,"referenced_works":["https://openalex.org/W183295127","https://openalex.org/W1493661991","https://openalex.org/W1560235933","https://openalex.org/W1566552089","https://openalex.org/W1964119857","https://openalex.org/W1988132050","https://openalex.org/W1996988774","https://openalex.org/W2010006094","https://openalex.org/W2016018248","https://openalex.org/W2027758271","https://openalex.org/W2035575256","https://openalex.org/W2042275390","https://openalex.org/W2049754879","https://openalex.org/W2050511894","https://openalex.org/W2051716090","https://openalex.org/W2052924791","https://openalex.org/W2061274033","https://openalex.org/W2065356639","https://openalex.org/W2068241960","https://openalex.org/W2072492565","https://openalex.org/W2084134548","https://openalex.org/W2088495219","https://openalex.org/W2090605216","https://openalex.org/W2098621549","https://openalex.org/W2105664651","https://openalex.org/W2113834527","https://openalex.org/W2128059732","https://openalex.org/W2129391890","https://openalex.org/W2130025413","https://openalex.org/W2135211390","https://openalex.org/W2150154671","https://openalex.org/W2152845747","https://openalex.org/W2161413792","https://openalex.org/W2162517951","https://openalex.org/W2170569385","https://openalex.org/W2171103562","https://openalex.org/W2258857078","https://openalex.org/W2294305355","https://openalex.org/W2304678994","https://openalex.org/W2312865100","https://openalex.org/W2313441277","https://openalex.org/W2335132016","https://openalex.org/W2620262408","https://openalex.org/W2801207912","https://openalex.org/W2888379487","https://openalex.org/W2963160020","https://openalex.org/W2963988918","https://openalex.org/W2972649475","https://openalex.org/W2988480584","https://openalex.org/W3104321313","https://openalex.org/W3110674950","https://openalex.org/W3114748763","https://openalex.org/W3134200358","https://openalex.org/W3208115557","https://openalex.org/W4206054140","https://openalex.org/W4211136162","https://openalex.org/W4212955877","https://openalex.org/W4230627818","https://openalex.org/W4233352824","https://openalex.org/W4234130962","https://openalex.org/W4297069203","https://openalex.org/W6602746890"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W4233892543","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W3000635646","https://openalex.org/W2033011390"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
