Pages that link to "Item:Q2018478"
From MaRDI portal
The following pages link to Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478):
Displaying 18 items.
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- A class of algorithms for mixed-integer bilevel min-max optimization (Q330266) (← links)
- A simple greedy heuristic for linear assignment interdiction (Q513608) (← links)
- Exact solution of a class of nonlinear knapsack problems (Q813968) (← 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)
- One-level reformulation of the bilevel Knapsack problem using dynamic programming (Q1941532) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
- Exact solution approaches for bilevel lot-sizing (Q2253561) (← links)
- Lower bounds and a new exact approach for the Bilevel Knapsack with Interdiction Constraints (Q2293085) (← links)
- Parametric Solution for Linear Bicriteria Knapsack Models (Q4363722) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
- Sequential Shortest Path Interdiction with Incomplete Information (Q4692013) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
- Solution techniques for bi-level knapsack problems (Q6047889) (← links)
