Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Vector maximization with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Bicriterion Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the minimum-area encasing rectangle for an arbitrary closed curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833809 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization on low rank nonconvex structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative programming problems: Analysis and efficient point search heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Separable Nonconvex Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selecting the <i>K</i>th Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3948568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral annexation, dualization and dimension reduction technique in global optimization / rank
 
Normal rank

Revision as of 13:27, 29 May 2024

scientific article
Language Label Description Also known as
English
Solving a class of multiplicative programs with 0-1 knapsack constraints
scientific article

    Statements

    Solving a class of multiplicative programs with 0-1 knapsack constraints (English)
    0 references
    0 references
    16 March 2000
    0 references
    multiplicative programming
    0 references
    \(0-1\) knapsack problems
    0 references
    concave minimization
    0 references
    branch-and-bound algorithms
    0 references
    Lagrangian relaxation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references