C++ Reference: class DimensionCumulOptimizerCore
This documentation is automatically generated.
Utility class used in Local/GlobalDimensionCumulOptimizer to set the LP
constraints and solve the problem.
| Method |
dimension | Return type: const RoutingDimension* |
DimensionCumulOptimizerCore | Arguments: const RoutingDimension* dimension,
bool use_precedence_propagator |
Optimize | Return type: bool Arguments: const std::function<int64(int64)>& next_accessor,
glop::LinearProgram* linear_program, glop::LPSolver* lp_solver,
std::vector<int64>* cumul_values, int64* cost,
int64* transit_cost, bool clear_lp = true |
OptimizeAndPack | Return type: bool Arguments: const std::function<int64(int64)>& next_accessor,
glop::LinearProgram* linear_program,
glop::LPSolver* lp_solver,
std::vector<int64>* cumul_values |
OptimizeAndPackSingleRoute | Return type: bool Arguments:
int vehicle, const std::function<int64(int64)>& next_accessor,
glop::LinearProgram* linear_program, glop::LPSolver* lp_solver,
std::vector<int64>* cumul_values |
OptimizeSingleRoute | Return type: bool Arguments: int vehicle,
const std::function<int64(int64)>& next_accessor,
glop::LinearProgram* linear_program,
glop::LPSolver* lp_solver,
std::vector<int64>* cumul_values, int64* cost,
int64* transit_cost, bool clear_lp = true In the OptimizeSingleRoute() and Optimize() methods, if both "cumul_values"
and "cost" parameters are null, we don't optimize the cost and stop at the
first feasible solution in the LP (since in this case only feasibility is
of interest).
|
