An upper bound for the zero-one knapsack problem and a branch and bound algorithm
From MaRDI portal
Publication:1245074
DOI10.1016/0377-2217(77)90024-8zbMath0374.90050OpenAlexW2056380589MaRDI QIDQ1245074
Publication date: 1977
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(77)90024-8
Related Items
A heuristic routine for solving large loading problems, Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study, Exact methods for the knapsack problem and its generalizations, An integer programming model for the allocation of databases in a distributed computer system, A new class of hard problem instances for the 0-1 knapsack problem, A new enumeration scheme for the knapsack problem, Exact approaches for the knapsack problem with setups, An exact algorithm for parallel machine scheduling with conflicts, On the nucleolus of the basic vehicle routing game, Solution of a tinned iron purchasing problem by Lagrangean relaxation, The inverse-parametric knapsack problem, Solving the optimal network problem, Dynamic programming algorithms for the zero-one knapsack problem, A novel reformulation for the single-sink fixed-charge transportation problem, Solution of the zero-one multiple knapsack problem, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack 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, Features for the 0-1 knapsack problem based on inclusionwise maximal solutions, A bound and bound algorithm for the zero-one multiple knapsack problem, The selective travelling salesman problem, On Bilevel Optimization with Inexact Follower, An exact algorithm for large unbounded knapsack problems, Algorithms for solving the single-sink fixed-charge transportation problem, Adjacency of the 0-1 knapsack problem, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, Tolerance analysis for 0-1 knapsack problems, A note on upper bounds to the robust knapsack problem with discrete scenarios, Dynamic generalized assignment problems with stochastic demands and multiple agent-task relationships, Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem, A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts, Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm, Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem, An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth, Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study, Formulating and solving production planning problems, A successive approximation algorithm for the multiple knapsack problem, New trends in exact algorithms for the \(0-1\) knapsack problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, The zero-one knapsack problem with equality constraint, Zero-one integer programs with few contraints - lower bounding theory, The bound improving sequence algorithm, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, Zero-one integer programs with few constraints - Efficient branch and bound algorithms
Cites Work
- Unnamed Item
- Reduction Algorithm for Zero-One Single Knapsack Problems
- Computing Partitions with Applications to the Knapsack Problem
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Approximate Algorithms for the 0/1 Knapsack Problem
- Discrete-Variable Extremum Problems
- A Finite Renewal Algorithm for the Knapsack and Turnpike Models
- The Theory and Computation of Knapsack Functions
- A Branch Search Algorithm for the Knapsack Problem
- An Enumeration Algorithm for Knapsack Problems
- Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
