{"id":"https://openalex.org/W7221461628","doi":"https://doi.org/10.33774/coe-2026-gqh4n","title":"Proposition of Improved Approach for Weighted Flow Problem","display_name":"Proposition of Improved Approach for Weighted Flow Problem","publication_year":2026,"publication_date":"2026-11-09","ids":{"openalex":"https://openalex.org/W7221461628","doi":"https://doi.org/10.33774/coe-2026-gqh4n"},"language":"en","primary_location":{"id":"doi:10.33774/coe-2026-gqh4n","doi":"https://doi.org/10.33774/coe-2026-gqh4n","is_oa":true,"landing_page_url":"https://doi.org/10.33774/coe-2026-gqh4n","pdf_url":"https://www.cambridge.org/engage/api-gateway/coe/assets/orp/resource/item/6ad338d8f4ef06beb6507186/original/proposition-of-improved-approach-for-weighted-flow-problem.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.cambridge.org/engage/api-gateway/coe/assets/orp/resource/item/6ad338d8f4ef06beb6507186/original/proposition-of-improved-approach-for-weighted-flow-problem.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073667933","display_name":"Mirzakhmet B Syzdykov","orcid":"https://orcid.org/0000-0002-8086-775X","observed_orcids":["https://orcid.org/0000-0002-8086-775X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mirzakhmet Syzdykov","raw_affiliation_strings":["Independent researcher , Astana , Kazakhstan"],"raw_orcid":"https://orcid.org/0000-0002-8086-775X","affiliations":[{"raw_affiliation_string":"Independent researcher , Astana , Kazakhstan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5073667933"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.0,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"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/minimum-cost-flow","display_name":"minimum cost flow","score":0.9309999942779541},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.8849999904632568},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6029999852180481}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4596000015735626},{"id":"https://openalex.org/C2777152325","wikidata":"https://www.wikidata.org/wiki/Q108163","display_name":"Proposition","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41429999470710754},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3903999924659729},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35910001397132874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3179999887943268},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.2831000089645386},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27619999647140503},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2526000142097473}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.33774/coe-2026-gqh4n","doi":"https://doi.org/10.33774/coe-2026-gqh4n","is_oa":true,"landing_page_url":"https://doi.org/10.33774/coe-2026-gqh4n","pdf_url":"https://www.cambridge.org/engage/api-gateway/coe/assets/orp/resource/item/6ad338d8f4ef06beb6507186/original/proposition-of-improved-approach-for-weighted-flow-problem.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},{"id":"doi:10.13140/rg.2.2.30895.29604","doi":"https://doi.org/10.13140/rg.2.2.30895.29604","is_oa":false,"landing_page_url":"https://doi.org/10.13140/rg.2.2.30895.29604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.33774/coe-2026-gqh4n","doi":"https://doi.org/10.33774/coe-2026-gqh4n","is_oa":true,"landing_page_url":"https://doi.org/10.33774/coe-2026-gqh4n","pdf_url":"https://www.cambridge.org/engage/api-gateway/coe/assets/orp/resource/item/6ad338d8f4ef06beb6507186/original/proposition-of-improved-approach-for-weighted-flow-problem.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7221461628.pdf","grobid_xml":"https://content.openalex.org/works/W7221461628.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W3107976745"],"related_works":["https://openalex.org/W7095904897","https://openalex.org/W7100024824","https://openalex.org/W2331834944","https://openalex.org/W2729624260","https://openalex.org/W2573142940","https://openalex.org/W3017377883","https://openalex.org/W2171845664","https://openalex.org/W2081188375","https://openalex.org/W6907571006","https://openalex.org/W2258441002"],"abstract_inverted_index":{"We":[0],"are":[1],"to":[2,32,37],"address":[3],"the":[4,8,18,24,33,39,44,57,61,73],"latest":[5],"improvement":[6],"over":[7],"existing":[9],"stable":[10],"and":[11,35],"generally":[12],"linear":[13],"or":[14,46],"optimal":[15],"algorithms":[16,42],"for":[17,43],"minimum-cost":[19],"flow":[20,49,63],"problem,":[21,50],"we":[22],"implement":[23],"novel":[25],"approach":[26],"in":[27],"which":[28,70],"it's":[29],"possible":[30],"do":[31],"optimization":[34],"approximate":[36],"almost":[38],"best":[40],"known":[41],"classical":[45],"original":[47,74],"maximum":[48,62],"our":[51],"solution":[52],"is":[53],"solely":[54],"based":[55],"on":[56],"previous":[58],"observations":[59],"of":[60,76],"problem":[64,78],"with":[65],"a":[66],"discrete":[67],"weighted":[68],"function,":[69],"can":[71],"suit":[72],"statement":[75],"this":[77]},"counts_by_year":[],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2026-10-12T00:00:00"}