Determining the K-best solutions of knapsack problems
From MaRDI portal
Publication:342015
DOI10.1016/J.COR.2014.03.008zbMATH Open1349.90716OpenAlexW2066502861MaRDI QIDQ342015FDOQ342015
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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- A Linear Programming Approach to the Cutting-Stock Problem
- An improved typology of cutting and packing problems
- Title not available (Why is that?)
- New developments in the primal-dual column generation technique
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Unbounded knapsack problem: Dynamic programming revisited
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- A Minimal Algorithm for the Bounded Knapsack Problem
- The Theory and Computation of Knapsack Functions
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- A new enumeration scheme for the knapsack problem
- A set partitioning heuristic for the generalized assignment problem
- Title not available (Why is that?)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
- Algorithmic Applications in Management
- A new lower bound for the linear knapsack problem with general integer variables
Cited In (5)
- 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
Uses Software
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)
