NingWi's Stars
INFORMSJoC/2023.0177
ed-lam/bcp-mapf
BCP-MAPF – branch-and-cut-and-price for multi-agent path finding
Yakun1125/Branch_and_Price_PMSPSDEC
A branch and price algorithm to solve a parallel machine scheduling problem
srtjanuario/binpacking-bp
A Branch and Price for the Bin Packing Problem
alberto-santini/maritime-vrp
Branch-and-price solver for the Feeder Network Design Problem
wssuite/NurseScheduler
A branch and price algorithm to solve a nurse scheduling problem. The algorithm is based on BCP from COIN-OR project.
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 :-)
dykhgit/benders_sample
A sample code for benders decomposition to solve a Inventory Routing Problem with Cplex C++ API
HosseinTohidi/L-shaped-Decomposition
martinbiel/StochasticPrograms.jl
Julia package for formulating and analyzing stochastic recourse models.
ytsao/Integer-L-shaped-method
Implement integer-L-shaped method for solving two-stage stochastic programming