A branch and search algorithm for a class of nonlinear knapsack problems (Q594771): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q161983
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Morito, Susumu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-6377(83)90047-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055498515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Methods for Pure Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Algorithm for Portfolio Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions / rank
 
Normal rank

Latest revision as of 10:14, 14 June 2024

scientific article
Language Label Description Also known as
English
A branch and search algorithm for a class of nonlinear knapsack problems
scientific article

    Statements

    A branch and search algorithm for a class of nonlinear knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    nonlinear knapsack problems
    0 references
    branch and search procedure
    0 references
    efficient algorithm
    0 references
    continuous (relaxed) solution
    0 references
    reduction
    0 references
    tight lower and upper bounds
    0 references
    capital budgeting
    0 references
    quadratic objective function
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references