A support tool for planning classrooms considering social distancing between students
From MaRDI portal
Publication:2065002
DOI10.1007/S40314-021-01718-WzbMATH Open1499.90110OpenAlexW4200378661MaRDI QIDQ2065002FDOQ2065002
Authors: Yanyan Li
Publication date: 6 January 2022
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-021-01718-w
Recommendations
Combinatorial optimization (90C27) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Title not available (Why is that?)
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Title not available (Why is that?)
- Towards an efficient augmented Lagrangian method for convex quadratic programming
- Packing congruent hyperspheres into a hypersphere
- Integer-friendly formulations for the \(r\)-separation problem
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Minimizing the object dimensions in circle and sphere packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- An Analysis of Network Location Problems with Distance Constraints
- Packing circles within ellipses
- A literature review on circle and sphere packing problems: models and methodologies
- The discrete p-dispersion problem
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- Optimising the palletisation of cylinders in cases
- The Packing of Equal Circles in a Square
- The Densest Packing of 9 Circles in a Square
- Integer programming formulations for approximate packing circles in a rectangular container
- Packing circular-like objects in a rectangular container
- Optimality properties of an augmented Lagrangian method on infeasible problems
- A new compact formulation for the discrete \(p\)-dispersion problem
- Location covering models. History, applications and advancements
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
Uses Software
This page was built for publication: A support tool for planning classrooms considering social distancing between students
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065002)