lab-core / NurseSchedulerLinks
A branch and price algorithm to solve a nurse scheduling problem. The algorithm is based on BCP from COIN-OR project.
☆33Updated last year
Alternatives and similar repositories for NurseScheduler
Users that are interested in NurseScheduler are comparing it to the libraries listed below
Sorting:
- Branch-and-price solver for the Feeder Network Design Problem☆36Updated 2 years ago
- Solving a TSP with the CPLEX C++ API.☆50Updated 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
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆20Updated 7 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆19Updated 2 years ago
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Updated 7 years ago
- ☆30Updated 11 years ago
- A solver based on column generation☆38Updated last month
- Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm☆49Updated 3 years ago
- Adaptive Large Neighbourhood Search for the Orienteering Problem☆12Updated 2 years ago
- Solving Elementary Longest/Shortest Path problems with Integer Programming☆14Updated 8 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 4 years ago
- Solomon benchmark instances☆32Updated 3 years ago
- Example code for using CPLEX and Java.☆24Updated 2 years 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
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Updated 6 years ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆76Updated last year
- Adaptive Heuristic Method Based on SA and LNS for Solving Vehicle Routing Problem☆13Updated 8 years ago
- Code and computational experiments of the paper "Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs" by Cristian Ramírez-Pico…☆16Updated 2 years ago
- Tabu Search heuristic for Travelling Salesperson Problems with Profits☆11Updated 7 years ago
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆90Updated 3 months ago
- A dynamic programming implementation for VRPPDTW based on state–space–time network representations☆62Updated 3 years ago
- Linear Programming in Short☆18Updated 4 years ago
- Branch-Cut-Price Framework☆30Updated 5 years ago
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆18Updated 3 years ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆21Updated 4 months ago
- ML-Constructive is a deep learning based constructive heuristic for the Traveling Salesman Problem.☆11Updated last year
- Combinatorial Optimization in Gurobi☆44Updated 2 years ago
- C++ branch-price-and-cut framework for electric vehicle routing problem with release time and due date, bounded bidirectional label setti…☆10Updated 4 years ago
- Optimization models using various solvers☆96Updated 8 years ago