Nonlinear 0–1 programming: I. Linearization techniques

DOI10.1007/BF02591796zbMath0553.90067MaRDI QIDQ3216430

Joseph B. Mazzola, Egon Balas

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

linearizationlinear inequalitiesgeneral multilinear programslower and upper bounding affine functionsNonlinear 0-1 programs

Mathematics Subject Classification ID

Nonlinear programming (90C30) Boolean programming (90C09)

Related Items (33)

Graph, clique and facet of Boolean logical polytope ⋮ A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope ⋮ Polyhedral analysis for concentrator location problems ⋮ An algorithm for indefinite integer quadratic programming ⋮ The Boolean quadratic polytope: Some characteristics, facets and relatives ⋮ Experiments in quadratic 0-1 programming ⋮ Strong valid inequalities for Boolean logical pattern generation ⋮ Nonlinear 0–1 programming: II. Dominance relations and algorithms ⋮ Roof duality for polynomial 0–1 optimization ⋮ Explicit convex and concave envelopes through polyhedral subdivisions ⋮ Upper-bounds for quadratic 0-1 maximization ⋮ Compact linearization for binary quadratic problems subject to assignment constraints ⋮ The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds ⋮ Lagrangean decomposition for integer nonlinear programming with linear constraints ⋮ A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique ⋮ Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method ⋮ Two new reformulation convexification based hierarchies for 0-1 MIPs ⋮ A survey of algorithms for the generalized assignment problem ⋮ Concave extensions for nonlinear 0-1 maximization problems ⋮ A branch and bound algorithm for designing reliable systems at a minimum cost ⋮ A revised Taha's algorithm for polynomial 0-1 programming ⋮ Robust metaheuristic algorithm for redundancy optimization in large-scale complex systems ⋮ A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation ⋮ The basic algorithm for pseudo-Boolean programming revisited ⋮ Continuous dynamical systems that realize discrete optimization on the hypercube ⋮ \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation ⋮ Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem ⋮ Matroid optimization problems with monotone monomials in the objective ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ An enumerative algorithm framework for a class of nonlinear integer programming problems ⋮ A constrained nonlinear 0-1 program for data allocation ⋮ Projection, lifting and extended formulation integer and combinatorial optimization ⋮ ``Miniaturized linearizations for quadratic 0/1 problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming
• Covering Relaxation for Positive 0-1 Polynomial Programs
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• L’algebre de Boole et ses applications en recherche operationnelle
• Methods of Nonlinear 0-1 Programming
• Technical Note—Generalized Covering Relaxation for 0-1 Programs
• Facets of the knapsack polytope
• The Generalized Lattice-Point Problem
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Duality in Discrete Programming: II. The Quadratic Case
• A Balasian-Based Algorithm for Zero-One Polynomial Programming

This page was built for publication: Nonlinear 0–1 programming: I. Linearization techniques