Matching and scheduling of student-company-talks for a university it-speed dating event
DOI10.1007/s43069-022-00144-wzbMath1495.90064OpenAlexW4292491606MaRDI QIDQ2167666
Julia Rieck, Christian Ackermann, Felix Hahne
Publication date: 25 August 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-022-00144-w
genetic algorithmmixed integer linear programmingMonte Carlo tree searchmatching and schedulingmodified stepping stone method
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Fairness in academic course timetabling
- Scheduling in sports: an annotated bibliography
- Scheduling non-professional table-tennis leagues
- Three remarks on the many-to-many stable matching problem
- Scheduling the South American qualifiers to the 2018 FIFA world cup by integer programming
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- RobinX: a three-field classification and unified data format for round-robin sports timetabling
- On a conjecture by Gale about one-sided matching problems
- Scheduling a non-professional indoor football league: a tabu search based approach
- Efficient lottery design
- Serial dictatorship and Pareto optimality
- The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems
- On a Class of Capacitated Transportation Problems
- Lotteries in student assignment: An equivalence result
- Linear-Time Approximation for Maximum Weight Matching
- Maximal Flow Through a Network
- Fairness and Rank-Weighted Utilitarianism in Resource Allocation
- Efficient algorithms for finding maximum matching in graphs
- The Economics of Matching: Stability and Incentives
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Open Shop Scheduling to Minimize Finish Time
- Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
- A new solution to the random assignment problem.
This page was built for publication: Matching and scheduling of student-company-talks for a university it-speed dating event
