Pages that link to "Item:Q833584"

The following pages link to A dynamic programming algorithm for the bilevel Knapsack problem (Q833584):

Displaying 31 items.

• The Subset Sum game (Q296979) (← links)
• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
• Strategies in competing subset selection (Q367644) (← links)
• Approximation algorithms for a bi-level knapsack problem (Q391212) (← links)
• Competitive subset selection with two agents (Q643027) (← links)
• A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
• On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
• The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
• An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
• Feature selection for classification models via bilevel optimization (Q1734837) (← links)
• One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532) (← links)
• An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
• Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
• On the Stackelberg knapsack game (Q2029942) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
• The stochastic bilevel continuous knapsack problem with uncertain follower's objective (Q2156390) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• Improved approximation algorithms for a bilevel knapsack problem (Q2354770) (← links)
• A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
• A faster algorithm for the continuous bilevel knapsack problem (Q2661565) (← links)
• Dynamic programming algorithm with objective level cut for nonlinear knapsack problem (Q2823517) (← links)
• A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem (Q3449428) (← links)
• Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
• Bilevel Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
• On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
• The subset sum game revisited (Q5918370) (← links)
• Solution techniques for bi-level knapsack problems (Q6047889) (← links)
• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)