Resources by OR in Education
Displaying 1 - 10 of 20
Bin Packing
The purpose of bin packing is to pack a collection of objects into containers called bins. The bins are all the same size and the objects to be packed are different sizes. The aim is to pack the objects into the bins using the fewest possible bins. In this example students are asked to save computer files onto a CD...
Bin Packing - Theatre booking
In this resource students are asked to play the role of a local theatre manager, tasked with finding the best way to organise the audience to minimise the amount of space they take up. To solve the problem students must apply a series of first fit algorithms.
The resource includes a teacher presentation,...
Careers in Operational Research (O.R.)
These videos, produced by the O.R Society, aim to explain what Operational Research (O.R.) is through a wide range of case studies and can be...
Climbing the Career Ladder
This resource explores the application of flow charts, algorithms and mathematical based careers. Student pairs take it in turns to roll a die and travel along the board, racing through primary school, GCSE revision and work experience towards a successful career.
The resource...
Courier Service
This Courier Service traveling salesperson activity is recommended as an additional resource when teaching the traveling salesperson problem. Students are required to determine and interpret upper bounds, lower bounds and consider real-world factors that may influence the problem.
Operational Research (O.R.) is the discipline of applying advanced analytical methods to help make better decisions. The O.R. approach often involves constructing and using mathematical models and problem structuring methods to represent the wide range of problems faced by organisations. The results of these models...
Dijkstra's Algorithm
Dijkstra's algorithm finds the shortest path for a given problem. Dijkstra's algorithm can be used to find the shortest route between two cities. This algorithm is so powerful that it not only finds the shortest path from a chosen source to a given destination, it also finds all of the shortest paths from the...
Flows
The network flow problem involves finding the optimum route through a flow network; a directed graph where each arc has a capacity and each arc receives a flow. Typical examples include: evacuation plans and delivery services. The problem involves students analysing the plan of a school canteen and deciding whether...
This journal is one of over 25,000 physical resources available from the Resources Collection. The Archive Collection covers over 50 years of curriculum development in the STEM subjects. The Contemporary Collection includes the latest publications from UK educational publishers.
Impact is a publication of...
This journal is one of over 25,000 physical resources available from the Resources Collection. The Archive Collection covers over 50 years of curriculum development in the STEM subjects. The Contemporary Collection includes the latest publications from UK educational publishers.
News bulletin magazine from...