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:
- Solving a TSP with the CPLEX C++ API.☆51Updated 5 years ago
- A solver based on column generation☆34Updated last month
- Solving Elementary Longest/Shortest Path problems with Integer Programming☆14Updated 8 years ago
- Branch-and-price solver for the Feeder Network Design Problem☆36Updated 2 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
- Adaptive Heuristic Method Based on SA and LNS for Solving Vehicle Routing Problem☆13Updated 7 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
- Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent trave…☆19Updated 5 years ago
- Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm☆49Updated 3 years ago
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Updated 5 years ago
- Branch-Cut-Price Framework☆30Updated 4 years ago
- ☆11Updated 2 months 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
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆16Updated 2 years ago
- Adaptive Large Neighbourhood Search for the Orienteering Problem☆11Updated 2 years ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆70Updated last year
- Hybrid Genetic Search for Arc Routing Problems. From "Node, edge, arc routing and turn penalties : Multiple problems - One neighborhood e…☆36Updated 4 years ago
- Elementary Shortest Path Problem with Resource Constraints☆33Updated last year
- Example code for using CPLEX and Java.☆24Updated 2 years ago
- Solomon benchmark instances☆32Updated 3 years ago
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Updated 7 years ago
- Using advanced MIP decomposition techniques like Column Generation, Benders' Decomposition, Lagrangian Relaxation to solve CVRP and UFL w…☆51Updated 5 years ago
- Optimization models using various solvers☆96Updated 8 years ago
- OptFrame - C++17/C++20/C++23 Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Ge…☆84Updated 2 months ago
- An implementation of VRPTW in CPLEX☆31Updated 3 months ago
- DIP is a decomposition-based solver framework for mixed integer linear programs.☆19Updated last month
- This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with …☆50Updated last year
- A dynamic programming implementation for VRPPDTW based on state–space–time network representations☆62Updated 3 years ago
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆19Updated 6 years ago
- Nutmeg – a MIP and CP branch-and-check solver☆26Updated 2 years ago