fabiofurini / B-P_BinPackingProblem
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 :-)
☆15Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for B-P_BinPackingProblem
- A solver based on column generation☆24Updated 2 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…☆17Updated 4 years ago
- A C++ Framework for Optimization☆27Updated this week
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆16Updated last year
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆16Updated last year
- It's the implementation for "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems"☆15Updated 6 months ago
- A more scalable version of FILO.☆19Updated last week
- Speeded-up LKH-3 version + Set Partitioning Heuristic phase. Participated to 12th DIMACS implementation challenge.☆11Updated 2 years ago
- Branch-Cut-Price Framework☆27Updated 4 years ago
- Set Partitioning Heuristic (SPH) based on CPLEX MILP solver and created starting from the CFT Heuristic implemented by Accorsi Luca and C…☆14Updated 11 months ago
- Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split …☆16Updated 6 years ago
- A standalone local search solver for general mixed integer programming☆13Updated 3 months ago
- RouteOpt☆23Updated 3 weeks ago
- Interactive Performance Evaluation Tools for Optimization Software☆26Updated last year
- Branch-and-price solver for the Feeder Network Design Problem☆34Updated last year
- A Fast Iterated-Local-Search Localized Optimization algorithm for the CVRP.☆45Updated last year
- The CVRPSEP package is a collection of routines, written in the C++ programming language, for separation of various classes of cuts in br…☆21Updated 4 months ago
- Feasibility Jump☆23Updated last year
- Fork of the Concorde TSP solver with an easier build procedure☆11Updated 8 months ago
- A Julia interface for VRPSolver☆13Updated last year
- Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking☆14Updated last year
- Bucket Graph Labeling Algorithm for Vehicle Routing☆13Updated this week
- A standalone local search solver for general integer linear programming☆15Updated 4 months ago
- A python implementation of the integer L-shaped method for solving two stage stochastic programs.☆17Updated 5 months ago
- Implementation of Integer bender's cut for SP proposed by Laporte et al.☆9Updated 5 years ago
- Decomposition Strategies for Vehicle Routing Heuristics☆25Updated 11 months ago
- A set of reusable components for fast prototyping CVRP heuristic solution approaches.☆16Updated last week
- Nutmeg – a MIP and CP branch-and-check solver☆23Updated last year
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆16Updated last year
- ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.☆64Updated 5 months ago