The Multiple-Choice Knapsack Problem
From MaRDI portal
Publication:4193264
DOI10.1287/opre.27.3.503zbMath0406.90052OpenAlexW2135814502MaRDI QIDQ4193264
Andris A. Zoltners, Prabhakant Sinha
Publication date: 1979
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1fc96009cee8c1d9a96113490252bf7c32e0e7a2
Integer ProgrammingBranch and Bound AlgorithmComputational StudyComparison of AlgorithmsLinear Programming RelaxationMultiple Choice Knapsack Problem
Related Items (60)
Online joint bid/daily budget optimization of Internet advertising campaigns ⋮ Exact methods for the knapsack problem and its generalizations ⋮ A new Lagrangian relaxation approach to the generalized assignment problem ⋮ Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ A versatile algorithm for assembly line balancing ⋮ Maximizing revenue of end of life items in retail stores ⋮ Capacity Constraints Across Nests in Assortment Optimization Under the Nested Logit Model ⋮ Improved modeling and solution methods for the multi-resource routing problem ⋮ The knapsack problem with generalized upper bounds ⋮ Bounds for nested knapsack problems ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ A dual approach for the continuous collapsing knapsack problem ⋮ A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting ⋮ Comparison of Different ACO Start Strategies Based on InterCriteria Analysis ⋮ On maintenance scheduling of production units ⋮ Improved lower bounds for the capacitated lot sizing problem with setup times. ⋮ Optimal sequential inspection policies ⋮ Two-row and two-column mixed-integer presolve using hashing-based pairing methods ⋮ A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints ⋮ Qos-aware service evaluation and selection ⋮ On the multicriteria allocation problem ⋮ On the calculation of true and pseudo penalties in multiple choice integer programming ⋮ A dynamic programming approach to the multiple-choice multi-period knapsack problem and the recursive APL2 code ⋮ A best first search exact algorithm for the multiple-choice multidimensional knapsack problem ⋮ AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints ⋮ An O(n) algorithm for the multiple-choice knapsack linear program ⋮ Budgeting with bounded multiple-choice constraints. ⋮ Continuous maximin knapsack problems with GLB constraints ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems ⋮ An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint ⋮ Process tolerance allocation in angular tolerance charting ⋮ A o(n logn) algorithm for LP knapsacks with GUB constraints ⋮ Minimum-diameter covering problems ⋮ A multi-criteria approach to approximate solution of multiple-choice knapsack problem ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ The newsvendor problem with capacitated suppliers and quantity discounts ⋮ A biased random-key genetic algorithm for the set orienteering problem ⋮ On the importance of variability when managing metrology capacity ⋮ A mathematical programming system for preference and compatibility maximized menu planning and scheduling ⋮ An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core ⋮ LP relaxation of the two dimensional knapsack problem with box and GUB constraints ⋮ A branch and bound algorithm for solving the multiple-choice knapsack problem ⋮ An O(n) algorithm for the linear multiple choice knapsack problem and related problems ⋮ The linear multiple choice knapsack problem ⋮ Unbounded knapsack problem: Dynamic programming revisited ⋮ Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem ⋮ Reliability optimization of a series system with multiple-choice and budget constraints ⋮ The matroidal knapsack: A class of (often) well-solvable problems ⋮ A dynamic programming algorithm for multiple-choice constraints ⋮ A fast algorithm for the linear multiple-choice knapsack problem ⋮ Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems. ⋮ Relief period optimization under budget constraints ⋮ \(\gamma\)-robust facility relocation problem ⋮ Fast Core Pricing for Rich Advertising Auctions
This page was built for publication: The Multiple-Choice Knapsack Problem
