New trends in exact algorithms for the \(0-1\) knapsack problem
From MaRDI portal
Publication:1569935
DOI10.1016/S0377-2217(99)00260-XzbMath0961.90090OpenAlexW2037698864WikidataQ58826490 ScholiaQ58826490MaRDI QIDQ1569935
David Pisinger, Silvano Martello, Paolo Toth
Publication date: 9 July 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00260-x
Related Items
Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study, An experimental study of random knapsack problems, An adaptive stochastic knapsack problem, 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, Robust efficiency measures for linear knapsack problem variants, Smallest covering regions and highest density regions for discrete distributions, An improved typology of cutting and packing problems, Generalized quadratic multiple knapsack problem and two solution approaches, An exact approach for the 0-1 knapsack problem with setups, A comparison of formulations and relaxations for cross-dock door assignment problems, Optimal partial hedging in a discrete-time market as a Knapsack problem, Tug scheduling for hinterland barge transport: a branch-and-price approach, An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem, Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties, Hybrid genetic algorithm for undirected traveling salesman problems with profits, Average performance of greedy heuristics for the integer knapsack problem., An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable, The computation of the worst conditional expectation., The multidimensional 0-1 knapsack problem: an overview., Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics, A survey of recent developments in multiobjective optimization, Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem, A new exact approach for the 0-1 collapsing knapsack problem, Simple solution methods for separable mixed linear and quadratic knapsack problem, Solving knapsack problems on GPU, A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP), An exact algorithm for the knapsack sharing problem, Where are the hard knapsack problems?, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over, Tree knapsack approaches for local access network design, A time-dependent multiple criteria single-machine scheduling problem, Exact algorithm for bi-objective 0-1 knapsack problem, A multi-criteria approach to approximate solution of multiple-choice knapsack problem, The binary knapsack problem with qualitative levels, A new extended formulation with valid inequalities for the capacitated concentrator location problem, Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem, Random knapsack in expected polynomial time, The 0-1 knapsack problem with fuzzy data, Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study, Complexity indices for the multidimensional knapsack problem, Reliable Dynamic Packet Scheduling over Lossy Real-Time Wireless Networks, Sensor network optimization of gearbox based on dependence matrix and improved discrete shuffled frog leaping algorithm, Lagrangean relaxation for the capacitated hub location problem with single assignment, A successive approximation algorithm for the multiple knapsack problem, Scheduling with uncertain processing times in mixed-criticality systems, A matheuristic for the 0--1 generalized quadratic multiple knapsack problem, A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem, Heuristics for the 0-1 multidimensional knapsack problem, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Approximate and exact algorithms for the fixed-charge knapsack problem, Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence, Cooperative and axiomatic approaches to the knapsack allocation problem, Heuristic allocation based on a dynamic programming state-space representation, Exact solution of a class of nonlinear knapsack problems, The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for the solution of the 0-1 knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- Resolution of the 0–1 knapsack problem: Comparison of methods
- Computing Partitions with Applications to the Knapsack Problem
- An Efficient Algorithm for the 0-1 Knapsack Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- Discrete-Variable Extremum Problems
