Solving a class of multiplicative programs with 0-1 knapsack constraints
From MaRDI portal
Recommendations
- A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- An Algorithm for Large Zero-One Knapsack Problems
- An Algorithm for Separable Nonconvex Programming Problems
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Determining the minimum-area encasing rectangle for an arbitrary closed curve
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3767009 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 757680 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Optimization on low rank nonconvex structures
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Solving Bicriterion Mathematical Programs
- Vector maximization with two objective functions
Cited in
(10)- A nonisolated optimal solution of general linear multiplicative programming problems
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms
- Global optimization method for linear multiplicative programming
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- Monotonic optimization techniques for solving knapsack problems
- Multicriteria 0-1 knapsack problems with \(k\)-min objectives
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- An outcome-space finite algorithm for solving linear multiplicative programming
This page was built for publication: Solving a class of multiplicative programs with 0-1 knapsack constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969464)
