A simple recipe for concise mixed 0-1 linearizations

Authors:
Warren P. Adams;Richard J. Forrester
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634, USA;Department of Mathematics and Computer Science, Dickinson College, Carlisle, PA 17013, USA
Venue:
Operations Research Letters
Year:
2005

Citing 3
Cited 7

Equivalent formulations of nonlinear integer problems for efficient optimization

Management Science
A linearization procedure for quadratic and cubic mixed-integer problems

Operations Research - Supplement
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs

Discrete Optimization

Generalized instruction selection using SSA-graphs

Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems
Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

Discrete Applied Mathematics
Novel binary linear programming for high performance clock mesh synthesis

Proceedings of the International Conference on Computer-Aided Design
Linear forms of nonlinear expressions: New insights on old ideas

Operations Research Letters
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs

Discrete Optimization
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

Operations Research
Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new linearization method for mixed 0-1 polynomial programs is obtained by repeatedly applying a classical strategy introduced almost 30 years ago. Two important contributions are: the most concise known linear representations of cubic and higher-degree problems, and a simple argument for explaining and extending two alternate linearizations.