{"id":"https://openalex.org/W2898617425","doi":"https://doi.org/10.7287/peerj.preprints.27264v1","title":"Novel approach for solving integer equal flow problem","display_name":"Novel approach for solving integer equal flow problem","publication_year":2018,"publication_date":"2018-10-08","ids":{"openalex":"https://openalex.org/W2898617425","doi":"https://doi.org/10.7287/peerj.preprints.27264v1","mag":"2898617425"},"language":"en","primary_location":{"id":"doi:10.7287/peerj.preprints.27264v1","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27264v1","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.7287/peerj.preprints.27264v1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Swapnil Kumar","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Swapnil Kumar","raw_affiliation_strings":["DataScience, Thoughtworks, Gurgaoon, Haryana, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DataScience, Thoughtworks, Gurgaoon, Haryana, India","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"Sasikanth Goteti","orcid":"https://orcid.org/0000-0001-8418-4959"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sasikanth Goteti","raw_affiliation_strings":["DataScience, Thoughtworks, Gurgaoon, Haryana, India"],"raw_orcid":"https://orcid.org/0000-0001-8418-4959","affiliations":[{"raw_affiliation_string":"DataScience, Thoughtworks, Gurgaoon, Haryana, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15935167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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/integer-programming","display_name":"Integer programming","score":0.6263999938964844},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.6021999716758728},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5770999789237976},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5156999826431274},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5138999819755554},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.504800021648407},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.4966999888420105},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4864000082015991}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6730999946594238},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6413999795913696},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6263999938964844},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6021999716758728},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5770999789237976},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5156999826431274},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5138999819755554},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.504800021648407},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.4966999888420105},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4864000082015991},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.38830000162124634},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.3440999984741211},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3075000047683716},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3052000105381012},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.30309998989105225},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2824000120162964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2703000009059906},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.2703000009059906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26460000872612},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.2531000077724457}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.7287/peerj.preprints.27264v1","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27264v1","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},{"id":"pmh:oai:arXiv.org:1912.04034","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1912.04034","pdf_url":"https://arxiv.org/pdf/1912.04034","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"doi:10.7287/peerj.preprints.27264v1","is_oa":true,"landing_page_url":"https://doi.org/10.7287/peerj.preprints.27264v1","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"posted-content"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"article":[2],"we":[3,39],"consider":[4],"a":[5,30,41,61],"certain":[6],"sub":[7],"class":[8],"of":[9,48],"Integer":[10],"Equal":[11],"Flow":[12],"problem,":[13],"which":[14,45,70],"are":[15],"known":[16,62,73],"NP":[17],"hard.":[18],"Currently":[19],"there":[20],"exist":[21],"no":[22],"direct":[23],"solutions":[24,74],"for":[25],"the":[26,49,53,58],"same.":[27],"It":[28],"is":[29],"common":[31],"problem":[32,59,69],"in":[33],"various":[34],"inventory":[35],"management":[36],"systems.":[37],"Here":[38],"discuss":[40],"local":[42],"minima":[43],"solution":[44],"uses":[46],"projection":[47],"convexspaces":[50],"to":[51],"resolve":[52],"equal":[54],"flows":[55],"and":[56,75],"turn":[57],"into":[60],"linear":[63],"integer":[64],"programming":[65],"or":[66,82],"constraint":[67],"satisfaction":[68],"have":[71],"reasonable":[72],"can":[76],"be":[77],"effectively":[78],"solved":[79],"using":[80],"simplex":[81],"other":[83],"standard":[84],"optimization":[85],"strategies":[86]},"counts_by_year":[],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2018-11-09T00:00:00"}