February 1, 1973

Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

Key Points

Key points are not available for this paper at this time.

Abstract

This paper gives rules that enable the transformation of a 0-1 polynomial programming problem into a 0-1 linear programming problem to be effected with reduced numbers of constraints. Rules are also given that provide reduced numbers of variables when the true variables of interest are not individual cross-product terms, but sums of such terms or polynomials of the form (∑x j ) p .

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Authors

Fred Glover

Simon Fraser University

Eugene Woolsey

Colorado School of Mines

Journals

Operations Research

Actions

Institutions

University of Colorado Boulder

Colorado School of Mines

University of Colorado System

References and Citations

Connected Papers

Building similarity graph...

Analyzing shared references across papers

Discussion

Cite this study

Glover et al. (Thu,) studied this question.

synapsesocial.com/papers/6a200162d4e6d3589704c971 — DOI: https://doi.org/10.1287/opre.21.1.156

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

A Method for Solving Discrete Optimization Problems· 1966 · 186 citations
An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital Budgeting· 1968 · 50 citations
A Linear Programming Approach to the Cutting Stock Problem—Part II· 1963 · 1,102 citations
An Additive Algorithm for Solving Linear Programs with Zero-One Variables· 1965 · 705 citations
Branch-and-Bound Methods: A Survey· 1966 · 1,980 citations

Also consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

A Method for Solving Discrete Optimization Problems· 1966 · 186 citations
An Extension of Lawler and Bell's Method of Discrete Optimization with Examples from Capital Budgeting· 1968 · 50 citations
A Linear Programming Approach to the Cutting Stock Problem—Part II· 1963 · 1,102 citations
An Additive Algorithm for Solving Linear Programs with Zero-One Variables· 1965 · 705 citations
Branch-and-Bound Methods: A Survey· 1966 · 1,980 citations

Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

Key Points

Abstract

Citation Network

Connected Papers

Discussion

Authors

Journals

Actions

Institutions

References and Citations

Citation Network

Connected Papers

Discussion

Cite this study

Also consider

Also consider