Determining the K-best solutions of knapsack problems

DOI10.1016/J.COR.2014.03.008MaRDI QIDQ342015zbMATH OpenOpenAlexFDO

Authors Aline A. S. Leão, Marcos N. Arenales, Luiz H. Cherri

Publication date 17 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2014.03.008

zbMATH Keywords

branch-and-boundknapsack problemsbest solutions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Recommendations

• An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
• Algorithmic Applications in Management
• An exact algorithm for large unbounded knapsack problems
• Publication:3471851
• scientific article; zbMATH DE number 2107164

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3580280 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A Minimal Algorithm for the Bounded Knapsack Problem
• A new enumeration scheme for the knapsack problem
• A new lower bound for the linear knapsack problem with general integer variables
• A set partitioning heuristic for the generalized assignment problem
• Algorithmic Applications in Management
• An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem
• An improved typology of cutting and packing problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• New developments in the primal-dual column generation technique
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
• Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
• Solving binary cutting stock problems by column generation and branch- and-bound
• Strip generation algorithms for constrained two-dimensional two-staged cutting problems
• The Theory and Computation of Knapsack Functions
• The constrained compartmentalized knapsack problem: mathematical models and solution methods
• Tight bounds for periodicity theorems on the unbounded knapsack problem
• Unbounded knapsack problem: Dynamic programming revisited

Cited in

(6)

• Finding the K mean-standard deviation shortest paths under travel time uncertainty
• Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem
• Finding multiplies solutions for non-linear integer programming
• A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing
• Algorithmic Applications in Management
• An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Determining the \(K\)-best solutions of knapsack problems

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