Publication | Closed Access

One-level reformulation of the bilevel Knapsack problem using dynamic programming

Mathematical ProgrammingEngineeringBilevel Knapsack ProblemInteger OptimizationOptimization ProblemBusinessSystems EngineeringDynamic ProgrammingLogisticsSupply Chain ManagementLinear ProgrammingCombinatorial OptimizationKnapsack ProblemMechanism DesignInteger ProgrammingDynamic OptimizationOperations Research