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)- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index
- Stochastic binary problems with simple penalties for capacity constraints violations
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
- Tight bounds for the identical parallel machine‐scheduling problem: Part II
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- Branch-and-cut-and-price for capacitated connected facility location
- Integrating dock-door assignment and vehicle routing with cross-docking
- Interdiction Games and Monotonicity, with Application to Knapsack Problems
- Complexity results and exact algorithms for robust knapsack problems
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- scientific article; zbMATH DE number 3852791 (Why is no real title available?)
- An experimental study of random knapsack problems
- An Algorithm for the 0-1 Equality Knapsack Problem
- A dynamic reformulation heuristic for generalized interdiction problems
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- An exact algorithm for the knapsack sharing problem
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
- Exact algorithms for the bin packing problem with fragile objects
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- Zero duality gap in surrogate constraint optimization: a concise review of models
- scientific article; zbMATH DE number 432989 (Why is no real title available?)
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Lock-free parallel dynamic programming
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- On the product knapsack problem
- Dynamic programming revisited: Improving knapsack algorithms
- Reoptimizing the 0-1 knapsack problem
- A novel reformulation for the single-sink fixed-charge transportation problem
- The packing while traveling problem
- A new exact approach for the 0-1 collapsing knapsack problem
- Enhanced capacitated facility location problem for mental accounting management using partial resource concentration
- The daily swab test collection problem
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- New upper bounds and exact methods for the knapsack sharing problem
- An optimization algorithm for a penalized knapsack problem
- High-Dimensional Cost-constrained Regression Via Nonconvex Optimization
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- scientific article; zbMATH DE number 6869279 (Why is no real title available?)
- Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
- A note on the Martello-Toth algorithm for one-dimensional knapsack problems
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
- Cutting plane versus compact formulations for uncertain (integer) linear programs
- Exact makespan minimization of unrelated parallel machines
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
- Reliability aware scheduling of bag of real time tasks in cloud environment
- \(0\)-\(1\) knapsack problems
- scientific article; zbMATH DE number 4152148 (Why is no real title available?)
- Lower and upper bounds for the bin packing problem with fragile objects
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- An exact algorithm for bilevel 0-1 knapsack problems
- The bilevel knapsack problem with stochastic right-hand sides
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- A unified pre-training and adaptation framework for combinatorial optimization on graphs
- An exact algorithm for the Knapsack problem with setup
- A new class of hard problem instances for the 0-1 knapsack problem
- A general purpose exact solution method for mixed integer concave minimization problems
- Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem
- An efficient algorithm for the collapsing knapsack problem
- Approximate and exact algorithms for the fixed-charge knapsack problem
- On the exact separation of cover inequalities of maximum-depth
- An exact algorithm for 0-1 polynomial Knapsack problems
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
- A fast large neighborhood search for disjunctively constrained knapsack problems
- Bilevel knapsack with interdiction constraints
- Algorithms for solving the single-sink fixed-charge transportation problem
- A binary search algorithm for the general coupled task scheduling problem
- Inversion of convection-diffusion equation with discrete sources
- A New Algorithm for the 0-1 Knapsack Problem
- Exact approaches for the knapsack problem with setups
- An exact algorithm for parallel machine scheduling with conflicts
- Tolerance analysis for 0-1 knapsack problems
- Stochastic set packing problem
- A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
- A hybrid algorithm for the unbounded knapsack problem
- Exact solution of the robust knapsack problem
- scientific article; zbMATH DE number 536590 (Why is no real title available?)
- On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function
- An exact method for binary fortification games
- An incentive dynamic programming method for the optimization of scholarship assignment
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Where are the hard knapsack problems?
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- Recent advances in selection hyper-heuristics
- scientific article; zbMATH DE number 2123489 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Multiple Knapsack 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)
