OperationsResearchModels.jl

A package for Operations Research problems.

Installation

julia> ]
(@v1.xx) pkg> add OperationsResearchModels

or

julia> using Pkg
julia> Pkg.add("OperationsResearchModels")

If you want to install latest source that is not registered yet, you can

julia> ]
(@1.xx) pkg> add https://github.com/jbytecode/OperationsResearchModels.jl

but it's not recommended.

Documentation

Please visit The Documentation Page. This page includes both the API documentation and examples.

Implemented Problems and Algorithms

• Assignment Problem
• Transportation Problem
• The Shortest Path
• Maximum Flow
• Minimum Cost-Flow
• Minimum Spanning Tree
• p-median for Location Selection
• CPM - Critical Path Method
• PERT - Project Evaluation and Review Technique
• The Knapsack Problem
• Johnson's Rule for Flow-Shop Scheduling
• Flow-shop Scheduling using Permutation Encoded Genetic Algorithms (using a Random Key Genetic Algorithm)
• Traveling Salesman with Random Key Genetic Algorithm
• Simplex Method with Real Valued Decision Variables
• 2-player zero-sum game solver

How to contribute

Please read the page Contributing before contributing.

Notes for the users

The package is implemented for mostly academic purposes. The implementations are not optimized for large-scale problems. The users are encouraged to use the package for educational purposes and small-scale problems.