Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
From MaRDI portal
Publication:3116647
Recommendations
- scientific article; zbMATH DE number 6869279
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Improved dynamic programming and approximation results for the knapsack problem with setups
- A dynamic programming algorithm for the discounted \(\{0 - 1\}\) knapsack problem with setup
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- \(0\)-\(1\) knapsack problems
- Publication:3481489
- Bounds for nested knapsack problems
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems
Cited in
(only showing first 100 items - show all)- An experimental study of random knapsack problems
- \(0\)-\(1\) knapsack problems
- Approximate and exact algorithms for the fixed-charge knapsack problem
- Reoptimizing the 0-1 knapsack problem
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Algorithms for solving the single-sink fixed-charge transportation problem
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation
- An exact algorithm for 0-1 polynomial Knapsack problems
- Determining the \(K\)-best solutions of knapsack problems
- A dynamic reformulation heuristic for generalized interdiction problems
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- scientific article; zbMATH DE number 536590 (Why is no real title available?)
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- Stochastic binary problems with simple penalties for capacity constraints violations
- Stochastic set packing problem
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Integrating dock-door assignment and vehicle routing with cross-docking
- A hybrid algorithm for the unbounded knapsack problem
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- An incentive dynamic programming method for the optimization of scholarship assignment
- LP bounds in various constraint programming approaches for orthogonal packing
- An exact algorithm for bilevel 0-1 knapsack problems
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Branch-and-cut-and-price for capacitated connected facility location
- New upper bounds and exact methods for the knapsack sharing problem
- Exact algorithms for the bin packing problem with fragile objects
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Inversion of convection-diffusion equation with discrete sources
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- A data mining-constraint satisfaction optimization problem for cost effective classification
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- Exact solution of the robust knapsack problem
- Lock-free parallel dynamic programming
- An exact algorithm for the knapsack sharing problem
- The packing while traveling problem
- An optimization algorithm for a penalized knapsack problem
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- Measuring instance difficulty for combinatorial optimization problems
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- A New Algorithm for the 0-1 Knapsack Problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- A binary search algorithm for the general coupled task scheduling problem
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- The bilevel knapsack problem with stochastic right-hand sides
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- A dynamic programming algorithm for the bilevel Knapsack problem
- Dynamic programming revisited: Improving knapsack algorithms
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Decomposition based hybrid metaheuristics
- On the product knapsack problem
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Robust efficiency measures for linear knapsack problem variants
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Complexity results and exact algorithms for robust knapsack problems
- scientific article; zbMATH DE number 3900494 (Why is no real title available?)
- A generalization of column generation to accelerate convergence
- Two-machine shop scheduling: Compromise between flexibility and makespan value
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Where are the hard knapsack problems?
- A computational comparison of flow formulations for the capacitated location-routing problem
- Integrated model for software component selection with simultaneous consideration of implementation and verification
- Combinatorial Benders' cuts for the strip packing problem
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- A branch-and-price algorithm for the capacitated facility location problem
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- An exact algorithm for the Knapsack problem with setup
- An exact algorithm for large unbounded knapsack problems
- Lower and upper bounds for the bin packing problem with fragile objects
- A weighted-sum method for solving the bi-objective traveling thief problem
- An exact method for binary fortification games
- A rigorous method for solving 0-1 polynomial knapsack problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- A faster FPTAS for knapsack problem with cardinality constraint
- A faster FPTAS for knapsack problem with cardinality constraint
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- On the exact separation of cover inequalities of maximum-depth
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- A computational note on the Martello-Toth knapsack algorithm
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem
- A general purpose exact solution method for mixed integer concave minimization problems
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Enhanced capacitated facility location problem for mental accounting management using partial resource concentration
- The daily swab test collection problem
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems
- Recent advances in selection hyper-heuristics
- A dual RAMP algorithm for single source capacitated facility location problems
- A novel reformulation for the single-sink fixed-charge transportation problem
- A branch-and-price algorithm for the two-dimensional level strip packing problem
This page was built for publication: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3116647)
