Limbo
|
Solve multiple knapsack problem with lagrangian relaxation. More...
Go to the source code of this file.
Classes | |
class | limbo::solvers::LagMultiplierUpdater< T > |
A base helper function object to update lagrangian multipliers using subgradient descent. All other schemes can be derived from this class. More... | |
class | limbo::solvers::SubGradientDescent< T > |
Update lagrangian multiplier with subgradient descent. More... | |
class | limbo::solvers::ProblemScaler< T, V > |
Base class for scaling scheme with default no scaling. More... | |
class | limbo::solvers::L2NormScaler< T, V > |
Scaling scheme with default L2 norm scaling. More... | |
class | limbo::solvers::FeasibleSearcher< T, V > |
Base heuristic to search for feasible solutions. More... | |
class | limbo::solvers::SearchByAdjustCoefficient< T, V > |
Heuristic to search for feasible solutions by adjusting coefficients so that some items will not be assigned to some bins. More... | |
class | limbo::solvers::MultiKnapsackLagRelax< T, V > |
Solve multiple knapsack problem with lagrangian relaxation. More... | |
struct | limbo::solvers::MultiKnapsackLagRelax< T, V >::CapacityConstraintPred |
Predicate whether a constraint is a capacity constraint. More... | |
struct | limbo::solvers::MultiKnapsackLagRelax< T, V >::CompareVariableByCoefficient |
Predicate to sort variables according to their coefficient from small to large. More... | |
class | limbo::solvers::LagMultiplierUpdater< T > |
A base helper function object to update lagrangian multipliers using subgradient descent. All other schemes can be derived from this class. More... | |
class | limbo::solvers::SubGradientDescent< T > |
Update lagrangian multiplier with subgradient descent. More... | |
class | limbo::solvers::ProblemScaler< T, V > |
Base class for scaling scheme with default no scaling. More... | |
class | limbo::solvers::MinCoefficientScaler< T, V > |
Scaling scheme with minimum coefficient in an expression. More... | |
class | limbo::solvers::L2NormScaler< T, V > |
Scaling scheme with default L2 norm scaling. More... | |
class | limbo::solvers::FeasibleSearcher< T, V > |
Base heuristic to search for feasible solutions. More... | |
class | limbo::solvers::SearchByAdjustCoefficient< T, V > |
Heuristic to search for feasible solutions by adjusting coefficients so that some items will not be assigned to some bins. More... | |
struct | limbo::solvers::SearchByAdjustCoefficient< T, V >::VariableMoveCost |
Wrapper for the move cost of an item. More... | |
struct | limbo::solvers::SearchByAdjustCoefficient< T, V >::CompareVariableMoveCost |
Compare variables by its move cost. More... | |
class | limbo::solvers::SearchByBinSmoothing< T, V > |
Heuristic to search for feasible solutions by smoothing dense bins. More... | |
struct | limbo::solvers::SearchByBinSmoothing< T, V >::VariableMoveCost |
Wrapper for the move cost of an item. More... | |
struct | limbo::solvers::SearchByBinSmoothing< T, V >::CompareVariableMoveCost |
Compare variables by its move cost. More... | |
struct | limbo::solvers::SearchByBinSmoothing< T, V >::CompareConstraintSlack |
Compare constraints by their slackness. More... | |
class | limbo::solvers::SearchByCombinedStrategy< T, V > |
Heuristic to search for feasible solutions by combined strategies. More... | |
Namespaces | |
limbo | |
namespace for Limbo | |
limbo::solvers | |
namespace for Limbo.Solvers | |
Solve multiple knapsack problem with lagrangian relaxation.
Definition in file MultiKnapsackLagRelax.h.