The Theory and Computation of Knapsack Functions
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A hybrid algorithm for the unbounded knapsack problem
- An improved partial enumeration algorithm for integer programming problems
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Trim-loss pattern rearrangement and its relevance to the flat-glass industry
- A note on modifying a two-dimensional trim-loss algorithm to deal with cutting restrictions
- Zero-one integer programs with few contraints - lower bounding theory
- An algorithm for the periodic solutions in the knapsack problem
- Exact methods for the knapsack problem and its generalizations
- Determining an upper bound for a class of rectangular packing problems
- A new enumeration scheme for the knapsack problem
- Practical adaptations of the Gilmore-Gomory approach to cutting stock problems
- Degeneracy in infinite horizon optimization
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Exact solutions for constrained two-dimensional cutting problems
- An analytical model for the container loading problem
- A better step-off algorithm for the knapsack problem
- The trim-loss and assortment problems: A survey
- Cutting stock problems and solution procedures
- Knowledge based approach to the cutting stock problem
- Packing problems
- Accelerating Greenberg's method for the computation of knapsack functions
- Optimizing two types of discrete functions, subject to linear restrictions
- Static main storage packing problems
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Solution for the constrained Guillotine cutting problem by simulated annealing
- A relation between the knapsack and group knapsack problems
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- Integrated defect detection and optimization for cross cutting of wooden boards
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- An improved version of Wang's algorithm for two-dimensional cutting problems written by J. F. Oliveira and J. S. Ferraira
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Improved heuristics for sequencing cutting patterns
- A dynamic programming approach to the optimization of elastic trusses
- The cutting stock problem in a hardboard industry: A case study.
- Exact algorithms for the guillotine strip cutting/packing problem.
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- The multidimensional 0-1 knapsack problem: an overview.
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
- Unbounded knapsack problem: Dynamic programming revisited
- Dynamic programming using the Fritz-John conditions
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- A constructive periodicity bound for the unbounded knapsack problem
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- Problem reduction heuristic for the 0-1 multidimensional knapsack problem
- Lumber production optimization
- An exact algorithm for the pallet loading problem
- Least-cost partition algorithms
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations
- The cutting stock problem in the canvas industry
- A simulated annealing approach for the circular cutting problem
- Multiperiod capacity expansion of a telecommunications connection with uncertain demand
- Generating optimal T-shape cutting patterns for circular blanks
- A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators
- A Gilmore-Gomory construction of integer programming value functions
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
- Interdicting facilities in tree networks
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
- A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
- An ant colony optimization approach for the multidimensional knapsack problem
- Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems
- A serial inventory system with supplier selection and order quantity allocation considering transportation costs
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A note on constraint aggregation and value functions for two-stage stochastic integer programs
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach
- A Stackelberg equilibrium for a missile procurement problem
- An algorithm for the computation of knapsack functions
- Some polyhedra related to combinatorial problems
- Generating optimal two-section cutting patterns for rectangular blanks
- The one dimensional Compartmentalised Knapsack problem: a case study
- Ameso optimization: a relaxation of discrete midpoint convexity
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Using GPU computing for solving the two-dimensional guillotine cutting problem
- Hybrid approaches for the two-scenario max-min knapsack problem
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- The unbounded knapsack problem
- A solution method for a knapsack problem and its variant
- A bi-objective guillotine cutting problem of stamping strips of equal circles
- Origin and early evolution of corner polyhedra
- Asignacion de recuerdos max-min: Propiedades y algoritmos
- The pallet packing problem for non-uniform box sizes
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
- Determining the K-best solutions of knapsack problems
- Intelligent water drops algorithm
- Modeling multiple plant sourcing decisions
This page was built for publication: The Theory and Computation of Knapsack Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560786)
