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 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
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- A faster FPTAS for knapsack problem with cardinality constraint
- A faster FPTAS for knapsack problem with cardinality constraint
- Decomposition based hybrid metaheuristics
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- A dynamic programming algorithm for the bilevel Knapsack problem
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem
- A branch-and-price algorithm for the capacitated facility location problem
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
- An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Exact algorithms for the 0-1 time-bomb knapsack problem
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- Solving robust bin-packing problems with a branch-and-price approach
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- A rigorous method for solving 0-1 polynomial knapsack problem
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Robust efficiency measures for linear knapsack problem variants
- Smallest covering regions and highest density regions for discrete distributions
- Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems
- LP bounds in various constraint programming approaches for orthogonal packing
- A dual RAMP algorithm for single source capacitated facility location problems
- A data mining-constraint satisfaction optimization problem for cost effective classification
- Two-machine shop scheduling: Compromise between flexibility and makespan value
- Algorithms for some hard knapsack problems
- Combinatorial Benders' cuts for the strip packing problem
- scientific article; zbMATH DE number 3900494 (Why is no real title available?)
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- A 0-1 knapsack model for evaluating the possible electoral college performance in two-party US presidential elections
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A computational note on the Martello-Toth knapsack algorithm
- Branch-and-bound and dynamic programming approaches for the knapsack problem
- A weighted-sum method for solving the bi-objective traveling thief problem
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
- Integrated model for software component selection with simultaneous consideration of implementation and verification
- Measuring instance difficulty for combinatorial optimization problems
- A generalization of column generation to accelerate convergence
- Optimization algorithms for the disjunctively constrained knapsack problem
- An exact algorithm for large unbounded knapsack problems
- A computational comparison of flow formulations for the capacitated location-routing problem
- Determining the K-best solutions of knapsack problems
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)
