lab-core / NurseSchedulerLinks
A branch and price algorithm to solve a nurse scheduling problem. The algorithm is based on BCP from COIN-OR project.
☆32Updated last year
Alternatives and similar repositories for NurseScheduler
Users that are interested in NurseScheduler are comparing it to the libraries listed below
Sorting:
- A solver based on column generation☆34Updated 2 months ago
- Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…☆20Updated 5 years ago
- Branch-and-Price Algorithm for the Bin Packing Problem (using CPLEX as pricer and LP solver). It implements a Ryan-Foster branching schem…☆16Updated 6 years ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆20Updated 2 months ago
- A solver for mixed integer bilevel programs☆54Updated 2 months ago
- Branch-and-price solver for the Feeder Network Design Problem☆36Updated 2 years ago
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Updated 5 years ago
- FAST (Finally An SDDP Toolbox) is an SDDP toolbox for Matlab☆24Updated 6 years ago
- Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm☆49Updated 3 years ago
- A tutorial on using C++/Cplex for OR problems. The tutorial is intended to be useful for every OR practitioner with an intermediary knowl…☆41Updated 3 years ago
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆20Updated 6 years ago
- A solver for the generalized assignment problem☆23Updated 6 months ago
- Solving Elementary Longest/Shortest Path problems with Integer Programming☆14Updated 8 years ago
- Hybrid Genetic Search for Arc Routing Problems. From "Node, edge, arc routing and turn penalties : Multiple problems - One neighborhood e…☆36Updated 4 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆17Updated 2 years ago
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆18Updated 2 years ago
- A C++ Framework for Optimization☆36Updated 3 weeks ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆70Updated last year
- Adaptive Heuristic Method Based on SA and LNS for Solving Vehicle Routing Problem☆13Updated 8 years ago
- An open-source parallel optimization solver for structured mixed-integer programming☆88Updated 2 years ago
- Nutmeg – a MIP and CP branch-and-check solver☆28Updated 2 years ago
- Solving a TSP with the CPLEX C++ API.☆51Updated 5 years ago
- A standalone local search solver for general integer linear programming☆16Updated last year
- A collection of structured optimization algorithms for two-stage (L-shaped) stochastic programs, written in Julia.☆11Updated 6 years ago
- Branch-Cut-Price Framework☆30Updated 5 years ago
- A Python implementation of Tabu Search Algorithm for the Traveling Salesman Problem☆19Updated 6 years ago
- Python code to solve robust multi-mode resource constrained project scheduling problem using Benders' decomposition approach vs compact m…☆11Updated 3 years ago
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Updated 7 years ago
- An implementation of VRPTW in CPLEX☆31Updated 4 months ago
- Adaptive Large Neighbourhood Search for the Orienteering Problem☆11Updated 2 years ago