A branch and bound algorithm for solving separable convex integer programming problems (Q1342308): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A General Algorithm for the Optimal Distribution of Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimum Distribution of Effort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Constrained Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining Optimal Reorder Intervals in Capacitated Production-Distribution Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Establishing Consistent and Realistic Reorder Intervals in Production-Distribution Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming algorithms: A survey / 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: Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / 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 hybrid approach to discrete mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-linear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of dynamic programming methodology for the solution of a class of nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for solving a class of nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569992 / rank
 
Normal rank

Latest revision as of 11:22, 23 May 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for solving separable convex integer programming problems
scientific article

    Statements

    A branch and bound algorithm for solving separable convex integer programming problems (English)
    0 references
    0 references
    0 references
    27 June 1995
    0 references
    branch-and-bound
    0 references
    nonlinear integer programming
    0 references
    separable convex objective function
    0 references
    fathoming
    0 references
    partitioning
    0 references
    reoptimizing schemes
    0 references

    Identifiers