These notes are around solving scheduling problems using graph data structure in R. Problems which can be broken as difference constraints can be solved as shortest Path Problem. This specific use case uses OPTRESS package and their graph algorithm for the purpose. Code and theory both explained for optimal understanding.
- Author of these notes is a Data Scientist and Entrepreneur in Bengaluru, India.
- Other qualifications of author – IIT Roorkee
- You’ll be asked to provide your contact details once you click payment button.
- After payment an email with complete notes will be sent to your email id.
- Proceed below.
Do you have any questions or apprehensions? —> Check our FAQ section
Are you confused whether you should pay for the notes? –> Check our FAQ section