Pages that link to "Item:Q4133409"
From MaRDI portal
The following pages link to An Algorithm for Nonlinear Knapsack Problems (Q4133409):
Displaying 28 items.
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- Conjugate duality and the curse of dimensionality (Q811416) (← links)
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Theory and applications of generalized dynamic programming: An overview (Q1119492) (← links)
- A hybrid method for solving nonlinear knapsack problems (Q1123129) (← links)
- An improved algorithm for non-linear integer programming (Q1136698) (← links)
- Optimization of spare parts for hierarchically decomposable systems (Q1154382) (← links)
- Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren (Q1158090) (← links)
- Multicriteria dynamic programming with an application to the integer case (Q1158349) (← links)
- An interactive dynamic programming approach to multicriteria discrete programming (Q1169938) (← links)
- The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions (Q1223621) (← links)
- A branch and bound algorithm for solving separable convex integer programming problems (Q1342308) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- Computational experiments with a class of dynamic programming algorithms of higher dimensions (Q2277161) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- An exact algorithm for linear integer programming problems with distributionally robust chance constraints (Q2698584) (← links)
- Stability, parametric, and postoptimality analysis of discrete optimization problems (Q3216432) (← links)
- A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
- Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints (Q3951912) (← links)
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions (Q3960473) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)