{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T19:36:38Z","timestamp":1767209798313,"version":"build-2238731810"},"posted":{"date-parts":[[2018,10,8]]},"group-title":"PeerJ Preprints","reference-count":0,"publisher":"PeerJ","license":[{"start":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T00:00:00Z","timestamp":1538956800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In this article we consider a certain sub class of Integer Equal Flow problem, which are known NP hard. Currently there exist no direct solutions for the same. It is a common problem in various inventory management systems. Here we discuss a local minima solution which uses projection of the convexspaces to resolve the equal flows and turn the problem into a known linear integer programming or constraint satisfaction problem which have reasonable known solutions and can be effectively solved using simplex or other standard optimization strategies<\/jats:p>","DOI":"10.7287\/peerj.preprints.27264v1","type":"posted-content","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T13:13:02Z","timestamp":1539004382000},"source":"Crossref","is-referenced-by-count":0,"title":["Novel approach for solving integer equal flow problem"],"prefix":"10.7287","author":[{"given":"Swapnil","family":"Kumar","sequence":"first","affiliation":[{"name":"DataScience, Thoughtworks, Gurgaoon, Haryana, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8418-4959","authenticated-orcid":true,"given":"Sasikanth","family":"Goteti","sequence":"additional","affiliation":[{"name":"DataScience, Thoughtworks, Gurgaoon, Haryana, India"}]}],"member":"4443","container-title":[],"original-title":[],"link":[{"URL":"https:\/\/peerj.com\/preprints\/27264v1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/preprints\/27264v1.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/preprints\/27264v1.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/preprints\/27264v1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,23]],"date-time":"2019-12-23T19:50:28Z","timestamp":1577130628000},"score":1,"resource":{"primary":{"URL":"https:\/\/peerj.com\/preprints\/27264v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,8]]},"references-count":0,"aliases":["10.7287\/peerj.preprints.27264"],"URL":"https:\/\/doi.org\/10.7287\/peerj.preprints.27264v1","relation":{},"subject":[],"published":{"date-parts":[[2018,10,8]]},"subtype":"preprint"}}