Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search

DOI10.2298/FIL1909875DzbMath1499.90181OpenAlexW3007478337MaRDI QIDQ5863640

Bojana Ćendić, Dušan Džamić, Aleksandar Đenić, Miroslav Marić

Publication date: 3 June 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1909875d

zbMATH Keywords

balanced groupsvariable neighborhood searchset partitioning

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Variable neighbourhood search: methods and applications
• Constrained group balancing: why does it work
• Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging
• Variable neighborhood search
• A class of bounded approximation algorithms for graph partitioning
• Assigning pupils to tutor groups in a comprehensive school
• Design of balanced MBA student teams

This page was built for publication: Solving balanced multi-weighted attribute set partitioning problem with variable neighborhood search