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

Cites Work

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

Cited In (50)

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

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)