BaPCod
From MaRDI portal
Cited in
(38)- ABACUS
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- A branch-and-price algorithm for the minimum latency problem
- Exact approaches for solving a covering problem with capacitated subtrees
- METSlib
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- DIP
- GENCOL
- On the exact solution of vehicle routing problems with backhauls
- A generic exact solver for vehicle routing and related problems
- On the exact solution of a large class of parallel machine scheduling problems
- Conference scheduling: a clustering-based approach
- GCG
- Random sampling and machine learning to understand good decompositions
- A generic exact solver for Vehicle Routing and related problems
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- hMETIS
- CVRPSEP
- Automatic Dantzig-Wolfe reformulation of mixed integer programs
- CVRPSP
- EMOSL
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Column generation based primal heuristics
- Partial convexification of general mips by Dantzig-Wolfe reformulation
- KAdaptabilitySolver
- Column generation for extended formulations
- ISUD
- Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization
- Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
- Exact approaches for single machine total weighted tardiness batch scheduling
- Bin Packing Problem with Time Lags
- Structure Detection in Mixed-Integer Programs
- MIPLIBing
- SearchCol
- Coluna.jl
- VRPSolver
- strIPlib
- Branching in branch-and-price: A generic scheme
This page was built for software: BaPCod
