fabiofurini / B-P_BinPackingProblemLinks
Branch-and-Price Algorithm for the Bin Packing Problem (using CPLEX as pricer and LP solver). It implements a Ryan-Foster branching scheme and it explores the branching tree in a depth-first fashion. The pricing problems are solved via a DP algorithm only at the root node. No heuristic initialisation phase... yet :-)
☆16Updated 6 years ago
Alternatives and similar repositories for B-P_BinPackingProblem
Users that are interested in B-P_BinPackingProblem are comparing it to the libraries listed below
Sorting:
- A solver based on column generation☆34Updated last month
- A C++ Framework for Optimization☆36Updated 3 weeks 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
- A standalone local search solver for general integer linear programming☆16Updated last year
- Branch-Cut-Price Framework☆30Updated 4 years ago
- Branch-and-price solver for the Feeder Network Design Problem☆36Updated 2 years ago
- Feasibility Jump☆28Updated last year
- Bucket Graph Labeling Algorithm for Vehicle Routing☆19Updated 5 months 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
- Nutmeg – a MIP and CP branch-and-check solver☆26Updated 2 years ago
- Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions☆29Updated 3 years ago
- A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem☆16Updated 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
- 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
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆50Updated 3 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
- Interactive Performance Evaluation Tools for Optimization Software☆28Updated last year
- Machine-learning-based column selection☆38Updated 3 years ago
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆48Updated 2 years ago
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆11Updated 5 years ago
- A more scalable version of FILO.☆23Updated 3 weeks ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆31Updated 4 months ago
- A standalone local search solver for general mixed integer programming☆24Updated last month
- Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…☆14Updated last year
- A python implementation of the integer L-shaped method for solving two stage stochastic programs.☆20Updated last year
- 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
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆70Updated last year
- Python codes for the traveling salesman problem and vehicle routing problem☆67Updated 3 years ago
- Asymmetric multi-depot vehicle routing problems: valid inequalities and a branch-and-cut algorithm☆49Updated 3 years ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 3 years ago