Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57445471, #quickstatements; #temporary_batch_1710976035288
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Convergent Duality Theory for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Resource Allocation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pegging algorithm for the nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5819795 / 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: A Survey of Methods for Pure Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Duality in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4371068 / 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: Q3141900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4286721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Separable Nonlinear Resource Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid method for solving nonlinear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric study of dual gaps, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(p\)th power Lagrangian method for integer 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: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a general nonlinear knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and search algorithm for a class of nonlinear knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition for integer nonlinear programming with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer approximate subdifferential method for piecewise affine optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Lagrangean Techniques for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonic Optimization: Problems and Solution Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of system reliability: a survey of problems and techniques† / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bundle methods for solving Lagrangian relaxation dual problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving certain singly constrained convex optimization problems in production planning / rank
 
Normal rank

Revision as of 01:19, 29 June 2024

scientific article
Language Label Description Also known as
English
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
scientific article

    Statements

    Convergent Lagrangian and domain cut method for nonlinear knapsack problems (English)
    0 references
    0 references
    13 February 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers