Pages that link to "Item:Q3116647"
From MaRDI portal
The following pages link to Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem (Q3116647):
Displayed 27 items.
- A dynamic programming algorithm for the bilevel Knapsack problem (Q833584) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections (Q1007645) (← links)
- A hybrid algorithm for the unbounded knapsack problem (Q1013302) (← links)
- A branch-and-price algorithm for the two-dimensional level strip packing problem (Q1029564) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- An experimental study of random knapsack problems (Q2369879) (← links)
- Algorithms for solving the single-sink fixed-charge transportation problem (Q2462557) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
- A data mining-constraint satisfaction optimization problem for cost effective classification (Q2499142) (← links)
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
- Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
- Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem (Q2572248) (← links)
- Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134) (← links)