Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200)

From MaRDI portal

Revision as of 21:57, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/coap/LiSWM09, #quickstatements; #temporary_batch_1731530891435)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Convergent Lagrangian and domain cut method for nonlinear knapsack problems (English)

0 references

0 references

Computational Optimization and Applications

0 references

publication date

13 February 2009

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10589-007-9113-1

0 references

A Convergent Duality Theory for Integer Programming

0 references

The Nonlinear Resource Allocation Problem

0 references

A pegging algorithm for the nonlinear resource allocation problem

0 references

0 references

The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

0 references

A Survey of Methods for Pure Nonlinear Integer Programming

0 references

A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem

0 references

Solving the subproblem in the lagrangian dual of separable discrete programs with linear constraints

0 references

The Lagrangian Relaxation Method for Solving Integer Programming Problems

0 references

Constructive Duality in Integer Programming

0 references

0 references

0 references

Branch and Bound Experiments in Convex Nonlinear Integer Programming

0 references

0 references

A nonlinear knapsack problem

0 references

Convex separable optimization is not much harder than linear optimization

0 references

0 references

0 references

Methods of descent for nondifferentiable optimization

0 references

Algorithms for Separable Nonlinear Resource Allocation Problems

0 references

A hybrid method for solving nonlinear knapsack problems

0 references

A geometric study of dual gaps, with applications

0 references

Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.

0 references

Nonlinear integer programming

0 references

\(p\)th power Lagrangian method for integer programming

0 references

A hybrid approach to discrete mathematical programming

0 references

0 references

A note on a general nonlinear knapsack problem

0 references

A branch and search algorithm for a class of nonlinear knapsack problems

0 references

An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems

0 references

Lagrangean decomposition for integer nonlinear programming with linear constraints

0 references

An outer approximate subdifferential method for piecewise affine optimization

0 references

0 references

A Survey of Lagrangean Techniques for Discrete Optimization

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

0 references

Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation

0 references

Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems

0 references

Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

0 references

Monotonic Optimization: Problems and Solution Approaches

0 references

Optimization of system reliability: a survey of problems and techniques†

0 references

New bundle methods for solving Lagrangian relaxation dual problems

0 references

Solving certain singly constrained convex optimization problems in production planning

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10589-007-9113-1

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

DBLP publication ID

journals/coap/LiSWM09

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1001200

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1001200&oldid=37909730"