A New Algorithm for the 0-1 Knapsack Problem
From MaRDI portal
Publication:3789335
DOI10.1287/mnsc.34.5.633zbMath0645.90054OpenAlexW1981434190MaRDI QIDQ3789335
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.5.633
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Boolean programming (90C09)
Related Items
An exact algorithm for the 0-1 collapsing knapsack problem, An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study, A computational note on the Martello-Toth knapsack algorithm, A branch-and-bound approach for spare unit allocation in a series system, Optimal experimental design for combinatorial problems, Inversion of convection-diffusion equation with discrete sources, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, New exact approaches and approximation results for the penalized knapsack problem, A new class of hard problem instances for the 0-1 knapsack problem, Robust efficiency measures for linear knapsack problem variants, Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities, Simple but efficient approaches for the collapsing knapsack problem, A minimal algorithm for the multiple-choice knapsack problem, The bottleneck generalized assignment problem, Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth, An expanding-core algorithm for the exact \(0-1\) knapsack problem, A minimal algorithm for the Bounded Knapsack Problem, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, Features for the 0-1 knapsack problem based on inclusionwise maximal solutions, On Bilevel Optimization with Inexact Follower, An exact algorithm for large unbounded knapsack problems, The multidimensional 0-1 knapsack problem: an overview., Multivariate composite distributions for coefficients in synthetic optimization problems, A best first search exact algorithm for the multiple-choice multidimensional knapsack problem, Core problems in bi-criteria \(\{0,1\}\)-knapsack problems, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, Adjacency of the 0-1 knapsack problem, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, Modeling and algorithmic development of a staff scheduling problem, An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem, Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems, Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem, A note on upper bounds to the robust knapsack problem with discrete scenarios, An efficient algorithm for the collapsing knapsack problem, Where are the hard knapsack problems?, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis, Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem, Efficient reformulation for 0-1 programs -- methods and computational results, New trends in exact algorithms for the \(0-1\) knapsack problem, Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem, Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
