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 50 items.
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Integrated model for software component selection with simultaneous consideration of implementation and verification (Q339707) (← links)
- Determining the \(K\)-best solutions of knapsack problems (Q342015) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
- Branch-and-cut-and-price for capacitated connected facility location (Q662139) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- Stochastic set packing problem (Q713096) (← links)
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- 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)
- Integrating dock-door assignment and vehicle routing with cross-docking (Q1651517) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- On the product knapsack problem (Q1653266) (← links)
- Exact algorithms for the bin packing problem with fragile objects (Q1662100) (← links)
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem (Q1683061) (← links)
- An incentive dynamic programming method for the optimization of scholarship assignment (Q1727142) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- The packing while traveling problem (Q1751654) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- A column generation heuristic for optimal wireless sensor network design with mobile sinks (Q1753436) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- An exact algorithm for bilevel 0-1 knapsack problems (Q1954852) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)