BaPCod
From MaRDI portal
Software:21850
swMATH9871MaRDI QIDQ21850FDOQ21850
Author name not available (Why is that?)
Cited In (22)
- Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- 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
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- 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
- 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
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
- 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
This page was built for software: BaPCod
