Lagrangean decomposition for integer nonlinear programming with linear constraints

DOI10.1007/BF01582893zbMath0753.90047MaRDI QIDQ1181738

Nelson F. Maculan, Philippe Yves Paul Michelon

Publication date: 27 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear constraintsinteger nonlinear programmingsolution algorithmsLagrangean decompositionproblem-splitting

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (20)

A survey for the quadratic assignment problem ⋮ Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach ⋮ Polyhedral analysis and decompositions for capacitated plant location-type problems ⋮ A look at the past and present of optimization - an editorial ⋮ Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint ⋮ A hybrid approach to resolving a differentiable integer program. ⋮ A distributed computation algorithm for solving portfolio problems with integer variables ⋮ An homage to Joseph-Louis Lagrange and Pierre Huard ⋮ Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints ⋮ An algebraic approach to integer portfolio problems ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ Towards strong duality in integer programming ⋮ Hub-and-spoke network design and fleet deployment for string planning of liner shipping ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Lagrangean methods for 0-1 quadratic problems ⋮ Convex mixed integer nonlinear programming problems and an outer approximation algorithm ⋮ Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method ⋮ On the mixed integer signomial programming problems ⋮ A nonlinear Lagrangian dual for integer programming ⋮ An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear 0–1 programming: I. Linearization techniques
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• Methods of Nonlinear 0-1 Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Mixed-integer quadratic programming

This page was built for publication: Lagrangean decomposition for integer nonlinear programming with linear constraints