Base-2 expansions for linearizing products of functions of discrete variables

DOI10.1287/OPRE.1120.1106MaRDI QIDQ4909117zbMATH OpenOpenAlexFDO

Authors Warren P. Adams, Stephen M. Henry

Publication date 12 March 2013

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://www.osti.gov/biblio/1648449

zbMATH Keywords

integernonlinearprogrammingtheory

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
• Maximizing the Product of Two Linear Functions In 0-1 Variables
• Linear forms of nonlinear expressions: new insights on old ideas
• Linearization of mixed-integer products
• A superior representation method for piecewise linear functions

Cited in

(17)

• Fractional 0-1 programming: applications and algorithms
• A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
• A note on linearized reformulations for a class of bilevel linear integer problems
• An enhanced logarithmic method for signomial programming with discrete variables
• A logarithmic method for eliminating binary variables and constraints for the product of free-sign discrete functions
• Encoding binary arithmetic operations in integer programming formulations
• An optimization approach for winner determination problem considering transportation cost discounts
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables
• Deterministic model for customized pilot manufacture production with various backplane sizes
• Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
• Incremental and encoding formulations for mixed integer programming
• Mixed integer linear programming formulation techniques
• Mathematical programming models and exact algorithms
• A combinatorial approach for small and strong formulations of disjunctive constraints
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
• Modeling combinatorial disjunctive constraints via junction trees
• Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations

This page was built for publication: Base-2 expansions for linearizing products of functions of discrete variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909117)