Year-end Sale % OFF 
Abstract
For the partitioning of large 0–1 integer sets, an algorithm is presented to compute in sequence a set of matrices where the different partitioned sets form the rows from which the optimum set is easily selected. The number of iterations equals the number of constraints and the technique yields fast and straightforward convergence of the solution. Practicality of the proposed algorithm is demonstrated through the optimum balancing of an assembly line.
Published Version
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 callMore From: Computer Methods in Applied Mechanics and Engineering
Disclaimer: 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.
