Stay organized with collections Save and categorize content based on your preferences.

C++ Reference: class SimpleBoundCosts

Note: This documentation is automatically generated.

A structure meant to store soft bounds and associated violation constants. It is 'Simple' because it has one BoundCost per element, in contrast to 'Multiple'. Design notes:
   - it is meant to store model information to be shared through pointers, so it disallows copy and assign to avoid accidental duplication.
   - it keeps soft bounds as an array of structs to help cache, because code that uses such bounds typically use both bound and cost.
   - soft bounds are named pairs, prevents some mistakes.
   - using operator[] to access elements is not interesting, because the structure will be accessed through pointers, moreover having to type bound_cost reminds the user of the order if they do a copy assignment of the element.

Return type: BoundCost&

Arguments: int element


Return type: BoundCost

Arguments: int element


Arguments: int num_bounds, BoundCost default_bound_cost


Arguments: const SimpleBoundCosts&) = delete; SimpleBoundCosts operator=(const SimpleBoundCosts&) = delete; private: std::vector<BoundCost> bound_costs_; }; #endif // !defined SWIG /// Dimensions represent quantities accumulated at nodes along the routes. They /// represent quantities such as weights or volumes carried along the route, or /// distance or times. /// /// Quantities at a node are represented by "cumul" variables and the increase /// or decrease of quantities between nodes are represented by "transit" /// variables. These variables are linked as follows: /// /// if j == next(i), /// cumuls(j) = cumuls(i) + transits(i) + slacks(i) + /// state_dependent_transits(i


Return type: int