Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search
Sign Up to like & getrecommendations! Published in 2019 at "Filomat"
DOI: 10.2298/fil1909875d
Abstract: This paper considers the Balanced Multi-Weighted Attribute Set Partitioning (BMWASP) problem which requires finding a partition of a given set of objects with multiple weighted attributes into a certain number of groups so that each… read more here.
Keywords: search; weighted attribute; attribute set; multi weighted ... See more keywords