Abstract
This article investigates the possibilities of solving certain zero-one integer programming problems on an analogue computer. It is shown that. Excepting the cases where the variables with equal weights in the objective function are constrained with each other. The gradient search technique with suitable modifications yields unique and straightforward solutions for set covering set partitioning and weighted matching problems. Experimental results are presented and discussed to illustrate the concepts involved.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
