Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
type: Item
instance of: scholarly article
title: Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
zbMATH Open document ID: 1151.90027
author: B. E. Eshmatov
published in: Journal of Global Optimization
publication date: 2008-09-23T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5346091
zbMATH Keywords: Lagrangian duality
zbMATH Keywords: separable nonlinear integer programming
zbMATH Keywords: polynomial zero-one programming
Wikidata QID: Q57445481
describes a project that uses: BARON
describes a project that uses: AIMMS
MaRDI profile type: Publication
full work available at URL: s10898-006-9128-7
OpenAlex ID: W1973251107
cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables
cites work: Nonlinear 0–1 programming: I. Linearization techniques
cites work: Nonlinear 0–1 programming: II. Dominance relations and algorithms
cites work: A Convergent Duality Theory for Integer Programming
cites work: An algorithm for concave integer minimization over a polyhedron
cites work: An algorithm and new penalties for concave integer minimization over a polyhedron
cites work: The Nonlinear Resource Allocation Problem
cites work: A pegging algorithm for the nonlinear resource allocation problem
cites work: On the computational complexity of reliability redundancy allocation in a series system
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Constructive Duality in Integer Programming
cites work: Q4331736
cites work: Q3270229
cites work: Integer Programming by Implicit Enumeration and Balas’ Method
cites work: Q4178782
cites work: Q4371068
cites work: Methods of Nonlinear 0-1 Programming
cites work: State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
cites work: A nonlinear knapsack problem
cites work: An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
cites work: Q3997222
cites work: Q4286721
cites work: A geometric study of dual gaps, with applications
cites work: Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
cites work: Towards strong duality in integer programming
cites work: \(p\)th power Lagrangian method for integer programming
cites work: A hybrid approach to discrete mathematical programming
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Q4040221
cites work: Q4040299
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: Analysis of bounds for multilinear functions
cites work: Global optimization of multiplicative programs
cites work: A Survey of Lagrangean Techniques for Discrete Optimization
cites work: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
cites work: Global optimization of nonconvex polynomial programming problems having rational exponents
cites work: Global optimization of nonconvex factorable programming problems
cites work: Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
cites work: Optimality condition and branch and bound algorithm for constrained redundancy optimization in series systems
cites work: A Balasian-Based Algorithm for Zero-One Polynomial Programming
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
DBLP publication ID: journals/jgo/LiWS07
DOI: 10.1007/S10898-006-9128-7
description: scientific article; zbMATH DE number 5346091