An algorithm and new penalties for concave integer minimization over a polyhedron (Q4287998): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
An algorithm and new penalties for concave integer minimization over a polyhedron
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using convex envelopes to solve the interactive fixed-charge linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398713 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/1520-6750(199404)41:3<435::aid-nav3220410309>3.0.co;2-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043806437 / rank
 
Normal rank
Property / title
 
An algorithm and new penalties for concave integer minimization over a polyhedron (English)
Property / title: An algorithm and new penalties for concave integer minimization over a polyhedron (English) / rank
 
Normal rank

Latest revision as of 11:17, 30 July 2024

scientific article; zbMATH DE number 553774
Language Label Description Also known as
English
An algorithm and new penalties for concave integer minimization over a polyhedron
scientific article; zbMATH DE number 553774

    Statements

    19 April 1994
    0 references
    branch-and-bound
    0 references
    penalty functions
    0 references
    Lagrangian relaxation
    0 references
    An algorithm and new penalties for concave integer minimization over a polyhedron (English)
    0 references

    Identifiers