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

DOI10.2298/FIL1909875DMaRDI QIDQ5863640zbMATH OpenOpenAlexFDO

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

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 groupsset partitioningvariable neighborhood search

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(1)

• The balanced maximally diverse grouping problem with attribute values

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863640)