OCR A-level Further Mathematics A H245 · 7.04d
Lower bound for the travelling salesperson problem
- Code
- 7.04d
- In
- 7.04 Network Algorithms
- Topic
- 7 Discrete Mathematics
- Course
- A-level Further Mathematics A H245
- Board
- OCR
Grade boundaries·OCR command words
Codes and titles are read by a script from OCR's published specification and have not been checked by a person. What each point covers is in the specification itself: OCR’s specification.
Points in 7.04 Network Algorithms
- 7.04a Least weight path between two vertices
- 7.04b Least weight set of arcs connecting all vertices
- 7.04c Least weight cycle through all vertices
- 7.04d Lower bound for the travelling salesperson problem
- 7.04e Route inspection problem
- 7.04f Network problems