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 week
- Branch-Cut-Price Framework☆30Updated 5 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
- A C++ Framework for Optimization☆36Updated 2 weeks ago
- A standalone local search solver for general integer linear programming☆16Updated last year
- Feasibility Jump☆28Updated 2 years ago
- Branch-and-price solver for the Feeder Network Design Problem☆36Updated 2 years ago
- A more scalable version of FILO.☆25Updated 2 months ago
- A standalone local search solver for general mixed integer programming☆28Updated 3 weeks ago
- Interactive Performance Evaluation Tools for Optimization Software☆28Updated last year
- 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
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆18Updated 2 years ago
- A matheuristic approach for the Capacitated Vehicle Routing Problem☆51Updated 3 years ago
- A Julia interface for VRPSolver☆17Updated 2 years ago
- Customized version of Helsgaun's LKH3 algorithm for vehicle routing problems.☆34Updated 6 months ago
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 3 years ago
- A solver for the generalized assignment problem☆23Updated 7 months ago
- Visual representation of the branch-and-cut tree of SCIP using spatial dissimilarities of LP solutions☆29Updated 3 years ago
- Feasibility Pump Collection☆15Updated 2 years ago
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆71Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆51Updated 2 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
- 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 set of reusable components for fast prototyping CVRP heuristic solution approaches.☆19Updated 2 months ago
- Machine-learning-based column selection☆39Updated 3 years ago
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆17Updated 2 years ago
- Nonlinear programming application examples solved with Artelys Knitro☆20Updated 3 weeks ago
- Nutmeg – a MIP and CP branch-and-check solver☆29Updated 2 years ago
- This is my implementation of a branch and price algorithm to solve the humanitarian aid distribution problem. This problem is a VRP with …☆51Updated last year