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 :-)
☆16Feb 24, 2019Updated 7 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Branch-and-price solver for the Feeder Network Design Problem☆37Feb 24, 2023Updated 3 years ago
- BCP-MAPF – branch-and-cut-and-price for multi-agent path finding☆99Jul 28, 2025Updated last year
- A branch and price algorithm to solve a nurse scheduling problem. The algorithm is based on BCP from COIN-OR project.☆34Jan 12, 2026Updated 8 months ago
- Source code for branch and bound based train timetabling algorithms, for paper titled: Single-track train timetabling with guaranteed opt…☆12Aug 26, 2020Updated 6 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 …☆61May 9, 2026Updated 4 months ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Elementary branch-price-and-cut algorithm for the vehicle routing problem with stochastic demands under optimal restocking☆17Feb 10, 2023Updated 3 years ago
- A state-of-the-art exact Branch-Cut-and-Price algorithm for the Capacitated Location-Routing Problem and related problems☆20Dec 19, 2022Updated 3 years ago
- Exact Branch-and-Benders-cut algorithm for the Maximal Covering Location Problem and for the Partial Set Covering Location Problem☆26Mar 30, 2023Updated 3 years ago
- A solver based on column generation☆44Updated this week
- C++ implementation of an incremental primal-dual assignment problem solver.☆12Dec 13, 2024Updated last year
- Nutmeg – a MIP and CP branch-and-check solver☆33Jun 22, 2023Updated 3 years ago
- ☆12Feb 25, 2021Updated 5 years ago
- 3D pattern viewer for cutting and packing problems☆17Dec 24, 2019Updated 6 years ago
- ☆11Nov 15, 2022Updated 3 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- Large scale decomposition algorithm (Lagrangian relaxation, Benders decomposition & Column generation) for CDN communication network.☆11Apr 17, 2018Updated 8 years ago
- An exact algorithm for the maximum clique problem (MCP) which improves over state-of-the-art approaches in some cases by orders of magnit…☆18Nov 15, 2025Updated 10 months ago
- A solver for the generalized assignment problem☆24Sep 3, 2026Updated 3 weeks ago
- Using advanced MIP decomposition techniques like Column Generation, Benders' Decomposition, Lagrangian Relaxation to solve CVRP and UFL w…☆54Oct 6, 2019Updated 6 years ago
- An algorithm for solving 2D strip packing problem.☆20Jul 23, 2017Updated 9 years ago
- OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.☆19Dec 7, 2022Updated 3 years ago
- A collaborative benchmark of Discrete Combinatorial Problems for evaluating AI systems in generating constraint models from natural langu…☆21Updated this week
- Example code for using CPLEX and Java.☆24Feb 15, 2023Updated 3 years ago
- Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pach…☆20Jan 18, 2023Updated 3 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Exact algorithm implementation based on Cplex Java API