Convergent Lagrangian and domain cut method for nonlinear knapsack problems

DOI10.1007/s10589-007-9113-1zbMath1153.90555OpenAlexW1976251432WikidataQ57445471 ScholiaQ57445471MaRDI QIDQ1001200

J. Martínez

Publication date: 13 February 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9113-1

Mathematics Subject Classification ID

Methods of quasi-Newton type (90C53) Dynamic programming (90C39)

Related Items

Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, An exact algorithm for linear integer programming problems with distributionally robust chance constraints, Unnamed Item, An efficient algorithm for multi-dimensional nonlinear knapsack problems, An efficient algorithm for nonlinear integer programming problems arising in series–parallel reliability systems, Distance confined path problem and separable integer programming

Uses Software

• GLOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and search algorithm for a class of nonlinear knapsack problems
• New bundle methods for solving Lagrangian relaxation dual problems
• A note on a general nonlinear knapsack problem
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• A hybrid method for solving nonlinear knapsack problems
• Solving certain singly constrained convex optimization problems in production planning
• Lagrangean decomposition for integer nonlinear programming with linear constraints
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
• A nonlinear knapsack problem
• An outer approximate subdifferential method for piecewise affine optimization
• Methods of descent for nondifferentiable optimization
• Nonlinear integer programming
• Monotonic Optimization: Problems and Solution Approaches
• Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation
• Algorithms for Separable Nonlinear Resource Allocation Problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
• Optimization of system reliability: a survey of problems and techniques†
• A Survey of Methods for Pure Nonlinear Integer Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints
• Constructive Duality in Integer Programming
• A Convergent Duality Theory for Integer Programming
• A hybrid approach to discrete mathematical programming
• A Survey of Lagrangean Techniques for Discrete Optimization
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
• The Nonlinear Resource Allocation Problem
• Convex separable optimization is not much harder than linear optimization
• Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
• \(p\)th power Lagrangian method for integer programming
• A geometric study of dual gaps, with applications
• A pegging algorithm for the nonlinear resource allocation problem