The table placement problem: a research challenge at the EWI 2007
From MaRDI portal
Publication:458951
DOI10.1007/s11750-012-0249-5zbMath1304.90170OpenAlexW2048028663MaRDI QIDQ458951
Martin Bischoff, Sergio García, Lieselot Vanhaverbeke, Valentina Cacchiani
Publication date: 8 October 2014
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-012-0249-5
Related Items (2)
Merging Combinatorial Design and Optimization: the Oberwolfach Problem ⋮ Congress seat allocation using mathematical optimization
Cites Work
- Unnamed Item
- Unnamed Item
- New facets and a branch-and-cut algorithm for the weighted clique problem.
- Formulating logical implications in combinatorial optimisation
- An approximation scheme for bin packing with conflicts
- Algorithms for the Bin Packing Problem with Conflicts
- An empirical comparison of heuristic methods for creating maximally diverse groups
- Assigning pupils to tutor groups in a comprehensive school
- Design of balanced MBA student teams
This page was built for publication: The table placement problem: a research challenge at the EWI 2007