惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

N
Netflix TechBlog - Medium
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
有赞技术团队
有赞技术团队
阮一峰的网络日志
阮一峰的网络日志
WordPress大学
WordPress大学
V
Visual Studio Blog
博客园_首页
大猫的无限游戏
大猫的无限游戏
Y
Y Combinator Blog
博客园 - Franky
Vercel News
Vercel News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
U
Unit 42
IT之家
IT之家
Last Week in AI
Last Week in AI
腾讯CDC
Martin Fowler
Martin Fowler
S
SegmentFault 最新的问题
量子位
I
InfoQ
T
The Blog of Author Tim Ferriss
The Cloudflare Blog
MyScale Blog
MyScale Blog
C
Check Point Blog

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
A Multi-Objective Approach to Curriculum-Based Course Tim...
[Submitted on 19 Jun 2026] · 2026-06-23 · via math updates on arXiv.org

View PDF

Abstract:We study a curriculum-based university course timetabling problem in which the preferences of two key stakeholder groups - lecturers and students - must be balanced while maintaining continuity across semesters in a weekly repeating timetable. While existing approaches typically rely on single-objective formulations or aggregate multiple objectives into a weighted sum, this can obscure the underlying trade-offs between conflicting stakeholder preferences. We therefore propose a multi-objective mixed-integer programming approach that explicitly separates lecturer and student objectives and incorporates timetable continuity by limiting the number of changes, called perturbations, in the time period assignments of selected courses relative to the corresponding semester of the previous academic year. To explore the resulting trade-offs, we develop a multi-objective solution approach based on the lexicographic $\varepsilon$-constraint method, enabling the computation of a representative set of solutions whose images, i.e., their vectors of objective values, cover different regions of the objective space.
The approach is evaluated on real-world instances from the Straubing Campus of the Technical University of Munich. The computational results reveal a clear and consistent trade-off between lecturers' and students' objectives across all instances. Moreover, the number of allowed perturbations is identified as a key decision parameter: relaxing this constraint significantly improves timetable quality for both stakeholder groups, although diminishing returns are observed beyond certain thresholds.
Overall, the proposed approach provides decision support by generating a diverse set of optimized timetables and enabling a transparent analysis of stakeholder trade-offs and continuity for the practical timetable planning process.

Submission history

From: Clemens Thielen [view email]
[v1] Fri, 19 Jun 2026 07:39:32 UTC (56 KB)