An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions (Q3960473): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1002/nav.3800260405 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1497951585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Objective function approximations in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid approach to discrete mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Nonlinear Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Balasian-Based Algorithm for Zero-One Polynomial Programming / rank
 
Normal rank

Latest revision as of 17:09, 13 June 2024

scientific article
Language Label Description Also known as
English
An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
scientific article

    Statements

    An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions (English)
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    separable nonlinear objective function
    0 references
    linear constraints
    0 references
    generalized Balas implicit enumeration scheme
    0 references
    computational experience
    0 references
    test problems
    0 references
    Branch and Bound
    0 references
    solution algorithm
    0 references
    0 references