Year: 2018
Type: preprint
Abstract: 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
Authors: Swapnil Kumar, Sasikanth Goteti
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W2898617425
Cites:
Cited by:
Related to: