Pages that link to "Item:Q3637393"
From MaRDI portal
The following pages link to An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem (Q3637393):
Displaying 24 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198) (← links)
- Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem (Q819064) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem (Q1309925) (← links)
- The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool (Q1357487) (← links)
- Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
- When two-constraint binary knapsack problem is equivalent to classical knapsack problem? (Q2080121) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Minimizing the number of tardy jobs in two-machine settings with common due date (Q2410033) (← links)
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem (Q2433806) (← links)
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
- An exact algorithm for 0-1 polynomial Knapsack problems (Q2469794) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)
- CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
- An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
- Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (Q3557805) (← links)
- An $0 (n^3)$ worst case bounded special $LP$ knapsack $(0-1)$ with two constraints (Q3813600) (← links)
