Conference scheduling: a clustering-based approach

DOI10.1016/j.ejor.2021.04.042zbMath1487.90275OpenAlexW3157410406MaRDI QIDQ2242187

Teobaldo Bulhões, Rubens Correia, Anand Subramanian

Publication date: 9 November 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.04.042

zbMATH Keywords

integer programmingschedulingcolumn generationconferences

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Uses Software

• BaPCod

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch-and-cut approaches for \(p\)-cluster editing
• Scheduling EURO-k conferences
• Facets of the clique partitioning polytope
• Variable neighborhood search
• Branch-and-price for \(p\)-cluster editing
• Improved branch-cut-and-price for capacitated vehicle routing
• On the asymmetric representatives formulation for the vertex coloring problem
• Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
• Increasing Service Levels in Conference and Educational Scheduling: A Heuristic Approach
• Designing Conferences to Improve Resource Utilization and Participant Satisfaction
• Reducibility among Combinatorial Problems
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• A small-to-medium-sized conference scheduling heuristic incorporating presenter and limited attendee preferences
• Efficient algorithms for cluster editing

This page was built for publication: Conference scheduling: a clustering-based approach