Piecewise convex maximization approach to multiknapsack (Q3646095): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1080/02331930902945033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113358274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing the \({\mathfrak R}\)-strategy for a reverse convex problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise-convex maximization problems: algorithm and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization and multi knapsack: a percolation algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trust branching path heuristic for zero-one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise-convex maximization problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture / rank
 
Normal rank

Latest revision as of 04:24, 2 July 2024

scientific article
Language Label Description Also known as
English
Piecewise convex maximization approach to multiknapsack
scientific article

    Statements

    Identifiers

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