The Multiple-Choice Knapsack Problem
From MaRDI portal
Publication:4193264
Cited in
(65)- Exact methods for the knapsack problem and its generalizations
- A new Lagrangian relaxation approach to the generalized assignment problem
- The knapsack problem with generalized upper bounds
- Bounds for nested knapsack problems
- On maintenance scheduling of production units
- On the calculation of true and pseudo penalties in multiple choice integer programming
- LP relaxation of the two dimensional knapsack problem with box and GUB constraints
- A minimal algorithm for the multiple-choice knapsack problem
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Unbounded knapsack problem: Dynamic programming revisited
- Reliability optimization of a series system with multiple-choice and budget constraints
- Smart greedy procedure for solving a multidimensional nonlinear knapsack class of reliability optimization problems.
- Relief period optimization under budget constraints
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method
- The linear multiple choice knapsack problem
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A biased random-key genetic algorithm for the set orienteering problem
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem
- Online joint bid/daily budget optimization of Internet advertising campaigns
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods
- On the importance of variability when managing metrology capacity
- \(\gamma\)-robust facility relocation problem
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- A versatile algorithm for assembly line balancing
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- On the complexity of cell flipping in permutation diagrams and multiprocessor scheduling problems
- A dynamic programming approach to the multiple-choice multi-period, knapsack problem and the recursive APL2 code
- Continuous maximin knapsack problems with GLB constraints
- Maximizing revenue of end of life items in retail stores
- AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
- An O(n) algorithm for the multiple-choice knapsack linear program
- Period decompositions for the capacitated lot sizing problem with setup times
- Capacity constraints across nests in assortment optimization under the nested logit model
- An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core
- A dual approach for the continuous collapsing knapsack problem
- A o(n logn) algorithm for LP knapsacks with GUB constraints
- A mathematical programming system for preference and compatibility maximized menu planning and scheduling
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- Minimum-diameter covering problems
- Comparison of different ACO start strategies based on InterCriteria analysis
- Process tolerance allocation in angular tolerance charting
- On the multicriteria allocation problem
- Fast Core Pricing for Rich Advertising Auctions
- Budgeting with bounded multiple-choice constraints.
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- Optimal sequential inspection policies
- An FPTAS for budgeted laminar matroid independent set
- Lower bounds for matroid optimization problems with a linear constraint
- Qini Curves for Multi-Armed Treatment Rules
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem
- Two-phase inspection policies on an imperfect metrology tool
- The newsvendor problem with capacitated suppliers and quantity discounts
- Unsplittable flow on a short path
- 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 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
- Solving the linear multiple choice knapsack problem with two objectives: Profit and equity
- Improved modeling and solution methods for the multi-resource routing problem
- Qos-aware service evaluation and selection
This page was built for publication: The Multiple-Choice Knapsack Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4193264)
