The Theory and Computation of Knapsack Functions

No abstract is available for this paper.

• Publication year

  1966

• Venue

  Operational Research

• Publication date

  1966-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1287/opre.14.6.1045
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A Finite Renewal Algorithm for the Knapsack and Turnpike Models

  1967cited by this paper
• Multistage Cutting Stock Problems of Two and More Dimensions

  1965cited by this paper
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS.

  1965cited by this paper
• Applied Dynamic Programming

  1965cited by this paper
• A Linear Programming Approach to the Cutting Stock Problem---Part II

  1963cited by this paper
• A Linear Programming Approach to the Cutting-Stock Problem

  1961cited by this paper
• Discrete-Variable Extremum Problems

  1957cited by this paper

• EATKG: An Open-Source Efficient Exact Algorithm for the Two-Dimensional Knapsack Problem with Guillotine Constraints

  2025cites this paper
• Expert Systems With Applications

  2025cites this paper
• Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications

  2025cites this paper
• An Improved Gaining Sharing Knowledge-Based Algorithm for Solving Resource Allocation Problems

  2025cites this paper
• Two-dimensional cutting strategy for defective wooden boards with parts clustering and two-stage algorithm

  2025cites this paper
• An adaptive binary quantum-behaved particle swarm optimization algorithm for the multidimensional knapsack problem

  2024cites this paper
• Profit Demand Delegated Proof of Stake: Hypothetical Design Concept for Blockchain

  2024cites this paper
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets

  2024cites this paper
• An exact algorithm for two-dimensional cutting problems based on multi-level pattern

  2024cites this paper
• A Double Optimum New Solution Method Based on EVA and Knapsack

  2024cites this paper
• Optimization of the One-Size-Fits-All Layout Problem Based on Preparing Material for Steel Bridges

  2024cites this paper
• Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems

  2023cites this paper
• An FPTAS for Budgeted Laminar Matroid Independent Set

  2023cites this paper
• Automation of the System of Efficient Packaging of Cargoes by Containers Using Heuristic Algorithms

  2023cites this paper
• A two-phase constructive algorithm for the single container mix-loading problem

  2023cites this paper
• Exact approaches for the unconstrained two-dimensional cutting problem with defects

  2023cites this paper
• Budget-based resource provisioning and scheduling algorithm for scientific workflows on IaaS cloud

  2023cites this paper
• PRILOG KREIRANJU OPTIMALNOG PLANA SADNJE KUKURUZA UPOTREBOM METODE DINAMIČKOG PROGRAMIRANJA

  2023cites this paper
• Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem

  2023cites this paper
• A GPU-based DP algorithm for solving multiple instances of the knapsack problem

  2023cites this paper
• Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting

  2023cites this paper
• Variable neighborhood search for the discounted {0-1} knapsack problem

  2022cites this paper
• Knapsack problems - An overview of recent advances. Part I: Single knapsack problems

  2022cites this paper
• Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem

  2022cites this paper
• Programação dinâmica paralela em GPU para os problemas da mochila uni e bi-dimensional

  2022cites this paper
• The Floating-Cuts model: a general and flexible mixed-integer programming model for non-guillotine and guillotine rectangular cutting problems

  2022cites this paper
• DE with A new population initialization method for the dynamic multidimensional knapsack problems

  2022cites this paper
• Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems

  2022cites this paper
• Research on the Cutting of Rectangular Blanks to Solve the Two-Dimensional Problem

  2022cites this paper
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem

  2022cites this paper
• An introduction to the two-dimensional rectangular cutting and packing problem

  2022cites this paper
• Explore on Online English Listening Evaluation System Using the Genetic Algorithm

  2022cites this paper
• A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem

  2021cites this paper
• Uso de GPUs na resolução do Problema da Mochila Multidimensional

  2021cites this paper
• A Gilmore-Gomory construction of integer programming value functions

  2021cites this paper
• Adaptive Resource Provisioning and Scheduling Algorithm for Scientific Workflows on IaaS Cloud

  2021cites this paper
• A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem

  2021cites this paper
• Interdicting facilities in tree networks

  2021cites this paper
• Heuristic and exact fixation-based approaches for the discounted 0-1 knapsack problem

  2021cites this paper
• Offloading Decision in Edge Computing for Continuous Applications Under Uncertainty

  2020cites this paper
• A Memetic Algorithm Based on Probability Learning for Solving the Multidimensional Knapsack Problem

  2020cites this paper
• A Gilmore-Gomory-Type Construction of Integer Programming Value Functions

  2020cites this paper
• Combining species distribution models and value of information analysis for spatial allocation of conservation resources

  2020cites this paper
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation

  2020cites this paper
• Bun splitting: an online cutting problem with defects from the food industry

  2020cites this paper
• References

  2020cites this paper
• A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem

  2020cites this paper
• Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems

  2020cites this paper
• Application of Pigeon Inspired Optimization for Multidimensional Knapsack Problem

  2020cites this paper
• Three-dimensional guillotine cutting problems with constrained patterns: MILP formulations and a bottom-up algorithm

  2020cites this paper
• SENSITIVITY ANALYSIS OF THE GENERALIZED KNAPSACK SHARING PROBLEM: PERTURBATION OF AN ARBITRARY PROFIT

  2020cites this paper
• Diversity-preserving quantum particle swarm optimization for the multidimensional knapsack problem

  2020cites this paper
• Development of the Optimization Model for Improving Safety at Rail Crossings in Florida

  2020cites this paper
• Imperialist Competitive Algorithm with Independence and Constrained Assimilation

  2020cites this paper
• A Quick Heuristic-Dynamic Programming for Two-Dimensional Cutting Problem

  2019cites this paper
• A methodology to determine size and shape of plots for sugarcane plantation

  2019cites this paper
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization

  2019cites this paper
• An Investigation into Prediction + Optimisation for the Knapsack Problem

  2019cites this paper
• Dental Restorations Packing Based on the Contour Similar Features Matching and Collision Strategy

  2019cites this paper
• An empirical analysis of exact algorithms for the unbounded knapsack problem

  2019cites this paper
• Tam Sayılı Programlama ve Simülasyon ile Raf Alanı Optimizasyonu: Bir Ambalaj Firmasında Uygulama

  2019cites this paper
• The constrained two-dimensional guillotine cutting problem with defects: an ILP formulation, a Benders decomposition and a CP-based algorithm

  2019cites this paper
• A Pareto evolutionary algorithm based on incremental learning for a kind of multi-objective multidimensional knapsack problem

  2019cites this paper
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function

  2019influential citation
• A one-pass heuristic for nesting problems

  2019cites this paper
• Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions

  2019cites this paper
• Efficient Food Storage and Price Prediction System

  2018cites this paper
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs

  2018cites this paper
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem

  2018cites this paper
• Prediction + optimization for the knapsack problem

  2018cites this paper
• Solving 0–1 knapsack problem by binary flower pollination algorithm

  2018cites this paper
• A Novel Discrete Grey Wolf Optimizer for Solving the Bounded Knapsack Problem

  2018cites this paper
• Minimization of the Wood Wastes for an Industry of Furnishing: a Two Dimensional Cutting Stock Problem

  2018cites this paper
• A Survey of the Knapsack Problem

  2018cites this paper
• Computational Intelligence and Intelligent Systems

  2018influential citation
• Traffic Analysis, Monitoring and Control using Agent Technologies (Simulation)

  2018cites this paper
• The Technique for Data Parallelism in Neural Processing Units

  2018cites this paper
• The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches

  2018cites this paper
• A Two-Phase Optimization Approach for Reducing the Size of the Cutting Problem in the Box-Production Industry: A Case Study

  2018cites this paper
• Ameso optimization: A relaxation of discrete midpoint convexity

  2018cites this paper
• A k-means binarization framework applied to multidimensional knapsack problem

  2018cites this paper
• A Multi-Agent Based Optimization Method for Combinatorial Optimization Problems

  2018cites this paper
• Algunos problemas clásicos de Optimización Combinatoria:una propuesta metodológica

  2017cites this paper
• A modified flower pollination algorithm for the multidimensional knapsack problem: human-centric decision making

  2017cites this paper
• Dynamic programming and mixed integer programming based algorithms for the online glass cutting problem with defects and production targets

  2017cites this paper
• A New Linear Programming Approach for TDGCS Layout Problem

  2017cites this paper
• Multidimensional 0–1 Knapsack using directed Bee Colony algorithm

  2017cites this paper
• Social Event Organization

  2017cites this paper
• The integrated lot sizing and cutting stock problem with saw cycle constraints applied to furniture production

  2017cites this paper
• The unbounded knapsack problem : a critical review

  2017cites this paper
• A Branch-and-cut Algorithm for Discrete Bilevel Linear Programs

  2017cites this paper
• Upper Bounds Categorization for Constrained Two-Dimensional Guillotine Cutting

  2017cites this paper
• A modified artificial bee colony approach for the 0-1 knapsack problem

  2017cites this paper
• A heuristic approach to minimize the number of saw cycles in small-scale furniture factories

  2017cites this paper
• Exact Algorithms and Evolutionary Algorithms for Randomized Time-Varying Knapsack Problem

  2017cites this paper
• A Dynamic Programming Algorithm for the Online Cutting Problem with Defects and Quality Grades

  2016cites this paper
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes

  2016cites this paper
• A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem

  2016cites this paper
• Column Generation at Strip Level for the k-Staged Two-Dimensional Cutting Stock Problem

  2016cites this paper
• A Branch-and-Bound Approach for the Constrained k-Staged 2-Dimensional Cutting Stock Problem

  2016cites this paper