An upper bound for the zero-one knapsack problem and a branch and bound algorithm

Cites work

scientific article; zbMATH DE number 3410784 (Why is no real title available?)
A Branch Search Algorithm for the Knapsack Problem
A Finite Renewal Algorithm for the Knapsack and Turnpike Models
A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
An Enumeration Algorithm for Knapsack Problems
Approximate Algorithms for the 0/1 Knapsack Problem
Computing Partitions with Applications to the Knapsack Problem
Discrete-variable extremum problems
Reduction Algorithm for Zero-One Single Knapsack Problems
Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
The Theory and Computation of Knapsack Functions

Cited in

(50)

The zero-one knapsack problem with equality constraint
The bound improving sequence algorithm
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
New trends in exact algorithms for the \(0-1\) knapsack problem
Algorithms for solving the single-sink fixed-charge transportation problem
An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth
Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
Local-search based heuristics for advertisement scheduling
LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
The selective travelling salesman problem
On the nucleolus of the basic vehicle routing game
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
A novel reformulation for the single-sink fixed-charge transportation problem
A new enumeration scheme for the knapsack problem
Zero-one integer programs with few constraints - Efficient branch and bound algorithms
Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
Exact approaches for the knapsack problem with setups
A bound and bound algorithm for the zero-one multiple knapsack problem
Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study
Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
An exact algorithm for parallel machine scheduling with conflicts
Solution of a tinned iron purchasing problem by Lagrangean relaxation
A heuristic routine for solving large loading problems
On bilevel optimization with inexact follower
Adjacency of the 0-1 knapsack problem
Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study
Zero-one integer programs with few contraints - lower bounding theory
Dynamic programming algorithms for the zero-one knapsack problem
The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem
A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
Formulating and solving production planning problems
The inverse-parametric knapsack problem
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
A new class of hard problem instances for the 0-1 knapsack problem
Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
Solution of the zero-one multiple knapsack problem
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
Solving the optimal network problem
An integer programming model for the allocation of databases in a distributed computer system
Branch-and-bound and dynamic programming approaches for the knapsack problem
A successive approximation algorithm for the multiple knapsack problem
A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
A note on upper bounds to the robust knapsack problem with discrete scenarios
Tolerance analysis for 0-1 knapsack problems
Exact methods for the knapsack problem and its generalizations
Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships
Foundations of operations research: from linear programming to data envelopment analysis
An exact algorithm for large unbounded knapsack problems

This page was built for publication: An upper bound for the zero-one knapsack problem and a branch and bound algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245074)