{"id":"https://openalex.org/W2046715803","doi":"https://doi.org/10.1137/s0097539794263695","title":"Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications","display_name":"Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2046715803","doi":"https://doi.org/10.1137/s0097539794263695","mag":"2046715803"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794263695","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794263695","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5111563320","display_name":"Alexander V. Karzanov","orcid":null},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alexander V. Karzanov","raw_affiliation_strings":["University of British Columbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of British Columbia","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079981879","display_name":"S. Thomas McCormick","orcid":"https://orcid.org/0000-0002-2828-4100"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Thomas McCormick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6322,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.95642606,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"4","first_page":"1245","last_page":"1275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9977999925613403,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965000152587891,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/mathematics","display_name":"Mathematics","score":0.7301589250564575},{"id":"https://openalex.org/keywords/unimodular-matrix","display_name":"Unimodular matrix","score":0.5854819416999817},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5333383679389954},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.5151494741439819},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5005464553833008},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.45288562774658203},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.44790148735046387},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43131375312805176},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4209805727005005},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39919713139533997},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3984914720058441},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2971459925174713},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14714789390563965}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7301589250564575},{"id":"https://openalex.org/C201958917","wikidata":"https://www.wikidata.org/wiki/Q1367055","display_name":"Unimodular matrix","level":2,"score":0.5854819416999817},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5333383679389954},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.5151494741439819},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5005464553833008},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.45288562774658203},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.44790148735046387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43131375312805176},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4209805727005005},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39919713139533997},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3984914720058441},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2971459925174713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14714789390563965}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539794263695","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794263695","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.590.3238","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.590.3238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.commerce.ubc.ca/faculty/mccormick/L14lcvx17s.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W228547482","https://openalex.org/W1505731132","https://openalex.org/W1554438646","https://openalex.org/W1963547452","https://openalex.org/W1975387839","https://openalex.org/W1977545325","https://openalex.org/W1977895455","https://openalex.org/W2027029507","https://openalex.org/W2036772106","https://openalex.org/W2048790997","https://openalex.org/W2053352956","https://openalex.org/W2060088365","https://openalex.org/W2071959614","https://openalex.org/W2079045732","https://openalex.org/W2090010485","https://openalex.org/W2090219729","https://openalex.org/W2093485760","https://openalex.org/W2097004206","https://openalex.org/W2100440346","https://openalex.org/W2103985627","https://openalex.org/W2155370486","https://openalex.org/W2156347727","https://openalex.org/W2203446654","https://openalex.org/W2404402443","https://openalex.org/W2480247681","https://openalex.org/W2485333863","https://openalex.org/W3138503030","https://openalex.org/W4293860921","https://openalex.org/W4301435544"],"related_works":["https://openalex.org/W2011745869","https://openalex.org/W2088028898","https://openalex.org/W2950905816","https://openalex.org/W211627054","https://openalex.org/W1608437562","https://openalex.org/W2302267847","https://openalex.org/W3121632479","https://openalex.org/W2157055357","https://openalex.org/W2093595318","https://openalex.org/W2770026079"],"abstract_inverted_index":{"We":[0,64,173,182,238],"consider":[1,184],"the":[2,12,30,43,47,54,60,68,176,220,260,263],"problem":[3],"of":[4,45,70,255],"minimizing":[5],"a":[6,17,22,40,51,164,236],"separable":[7],"convex":[8],"objective":[9,185,264],"function":[10],"over":[11],"linear":[13,33,79,198,222,253],"space":[14],"given":[15,267],"by":[16,82,240,268],"system":[18],"Mx=0":[19],"with":[20,167],"M":[21],"totally":[23],"unimodular":[24],"matrix.":[25],"In":[26],"particular,":[27],"this":[28],"generalizes":[29],"usual":[31],"minimum":[32,71],"cost":[34,80],"circulation":[35],"and":[36,42,59,84,94,103,116,138,192,199,201,233,258],"cocirculation":[37],"problems":[38,44,99],"in":[39,214,219,235],"network":[41],"determining":[46],"Euclidean":[48],"distance":[49],"from":[50],"point":[52],"to":[53,96,162,210,243,247,252,259],"perfect":[55],"bipartite":[56],"matching":[57],"polytope":[58],"feasible":[61],"flows":[62],"polyhedron.":[63],"first":[65],"show":[66,203],"that":[67,187],"idea":[69],"mean":[72],"cycle":[73],"canceling":[74],"originally":[75],"worked":[76],"out":[77],"for":[78,170,230],"circulations":[81,232],"Goldberg":[83],"Tarjan":[85],"[J.":[86],"Assoc.":[87],"Comput.":[88],"Mach.,":[89],"36":[90],"(1989),":[91],"pp.":[92,112],"873--886.]":[93],"extended":[95],"some":[97],"other":[98],"[T.":[100,133],"R.":[101],"Ervolina":[102],"S.":[104],"T.":[105],"McCormick,":[106],"Discrete":[107],"Appl.":[108],"Math.,":[109],"46":[110],"(1993),":[111],"133--165],":[113],"[A.":[114],"Frank":[115],"A.":[117,135],"V.":[118,136],"Karzanov,":[119,137],"Technical":[120,146],"Report":[121],"RR":[122],"895-M,":[123],"Laboratoire":[124],"ARTEMIS":[125],"IMAG,":[126],"Universit\u00e9":[127],"Joseph":[128],"Fourier,":[129],"Grenoble,":[130],"France,":[131,157],"1992],":[132],"Ibaraki,":[134],"H.":[139],"Nagamochi,":[140],"private":[141],"communication,":[142],"1993],":[143],"[M.":[144],"Hadjiat,":[145],"Report,":[147],"Groupe":[148],"Intelligence":[149],"Artificielle,":[150],"Facult\u00e9":[151],"des":[152],"Sciences":[153],"de":[154],"Luminy,":[155],"Marseille,":[156],"1994]":[158],"can":[159,207],"be":[160,208],"generalized":[161],"give":[163],"combinatorial":[165],"method":[166],"geometric":[168],"convergence":[169],"our":[171,245],"problem.":[172],"also":[174],"generalize":[175],"computationally":[177],"more":[178],"efficient":[179],"cancel-and-tighten":[180],"method.":[181],"then":[183,227],"functions":[186,265],"are":[188,226,266],"piecewise":[189,193,196,221],"linear,":[190],"pure":[191],"quadratic,":[194,200],"or":[195],"mixed":[197],"we":[202],"how":[204,242],"both":[205],"methods":[206,246],"implemented":[209],"find":[211,248],"exact":[212],"solutions":[213],"polynomial":[215,218],"time":[216],"(strongly":[217],"case).":[223],"These":[224],"implementations":[225],"further":[228],"specialized":[229],"finding":[231],"cocirculations":[234],"network.":[237],"finish":[239],"showing":[241],"extend":[244],"optimal":[249],"integer":[250],"solutions,":[251],"spaces":[254],"larger":[256],"fractionality,":[257],"case":[261],"when":[262],"approximate":[269],"oracles.":[270]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}