Ld
L. de Hoop
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
2 records found
1
The patient-and-nurse-to-room assignment (PNRA) problem is an optimization problem related to hospital wards. This is an integrated problem in which patients and nurses are assigned to rooms in a way that minimizes various objectives. One of these objectives is the continuity of care objective. This objective aims to improve the relationship between a patient and their caregivers by minimizing the number of different nurses a patient has.
Because the PNRA problem is difficult to solve using ILPs, various heuristics are developed that focus on the continuity of care. These are the greedy heuristics, which greedily find a patient-to-room assignment, the interval heuristic, which solves the problem in several intervals, and simulated annealing.
A dataset of 70 instances was used to tune and evaluate the heuristics. These were separated into different sizes based on the number of patients. It was concluded that the performance of the heuristics depends on the instance size. For small instances, the best solutions were found using the interval heuristic and simulated annealing. For larger instances, the greedy non-sequential heuristic found the best solutions. ...
Because the PNRA problem is difficult to solve using ILPs, various heuristics are developed that focus on the continuity of care. These are the greedy heuristics, which greedily find a patient-to-room assignment, the interval heuristic, which solves the problem in several intervals, and simulated annealing.
A dataset of 70 instances was used to tune and evaluate the heuristics. These were separated into different sizes based on the number of patients. It was concluded that the performance of the heuristics depends on the instance size. For small instances, the best solutions were found using the interval heuristic and simulated annealing. For larger instances, the greedy non-sequential heuristic found the best solutions. ...
The patient-and-nurse-to-room assignment (PNRA) problem is an optimization problem related to hospital wards. This is an integrated problem in which patients and nurses are assigned to rooms in a way that minimizes various objectives. One of these objectives is the continuity of care objective. This objective aims to improve the relationship between a patient and their caregivers by minimizing the number of different nurses a patient has.
Because the PNRA problem is difficult to solve using ILPs, various heuristics are developed that focus on the continuity of care. These are the greedy heuristics, which greedily find a patient-to-room assignment, the interval heuristic, which solves the problem in several intervals, and simulated annealing.
A dataset of 70 instances was used to tune and evaluate the heuristics. These were separated into different sizes based on the number of patients. It was concluded that the performance of the heuristics depends on the instance size. For small instances, the best solutions were found using the interval heuristic and simulated annealing. For larger instances, the greedy non-sequential heuristic found the best solutions.
Because the PNRA problem is difficult to solve using ILPs, various heuristics are developed that focus on the continuity of care. These are the greedy heuristics, which greedily find a patient-to-room assignment, the interval heuristic, which solves the problem in several intervals, and simulated annealing.
A dataset of 70 instances was used to tune and evaluate the heuristics. These were separated into different sizes based on the number of patients. It was concluded that the performance of the heuristics depends on the instance size. For small instances, the best solutions were found using the interval heuristic and simulated annealing. For larger instances, the greedy non-sequential heuristic found the best solutions.
In this paper, we provide a method to find all equable triangles on a given grid. Equable triangles are triangles that have the same perimeter and area. The amount of equable triangles was already found for the integer and the Eisenstein lattice. We adapt the proof by Aebi and Cairns for the Eisenstein lattice to work on general lattices. This is done in three steps:
1. Find a constraint on the side lengths of equable triangles on a given grid.
2. Find all equable triangles subject to this constraint.
3. Check for each triangle found if it can be placed on the grid.
Using this method, we can find all equable triangles on a given grid. On most grids, no equable triangles can be placed. When it is possible, they often had integer side lengths. ...
1. Find a constraint on the side lengths of equable triangles on a given grid.
2. Find all equable triangles subject to this constraint.
3. Check for each triangle found if it can be placed on the grid.
Using this method, we can find all equable triangles on a given grid. On most grids, no equable triangles can be placed. When it is possible, they often had integer side lengths. ...
In this paper, we provide a method to find all equable triangles on a given grid. Equable triangles are triangles that have the same perimeter and area. The amount of equable triangles was already found for the integer and the Eisenstein lattice. We adapt the proof by Aebi and Cairns for the Eisenstein lattice to work on general lattices. This is done in three steps:
1. Find a constraint on the side lengths of equable triangles on a given grid.
2. Find all equable triangles subject to this constraint.
3. Check for each triangle found if it can be placed on the grid.
Using this method, we can find all equable triangles on a given grid. On most grids, no equable triangles can be placed. When it is possible, they often had integer side lengths.
1. Find a constraint on the side lengths of equable triangles on a given grid.
2. Find all equable triangles subject to this constraint.
3. Check for each triangle found if it can be placed on the grid.
Using this method, we can find all equable triangles on a given grid. On most grids, no equable triangles can be placed. When it is possible, they often had integer side lengths.