BaPCod

swMATH9871MaRDI QIDQ21850FDOQ21850

Author name not available (Why is that?)

Official website: https://bapcod.math.u-bordeaux.fr

Cited In (37)

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

This page was built for software: BaPCod