Recognition problems for special classes of polynomials in 0–1 variables
- 1 May 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 44 (1), 139-155
- https://doi.org/10.1007/bf01587085
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean FunctionsSIAM Journal on Discrete Mathematics, 1988
- Unimodular functionsDiscrete Applied Mathematics, 1986
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functionsDiscrete Applied Mathematics, 1985
- On submodular function minimizationCombinatorica, 1985
- Minimum cuts, modular functions, and matroid polyhedraNetworks, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Submodular functions and convexityPublished by Springer Nature ,1983
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Methods of Nonlinear 0-1 ProgrammingAnnals of Discrete Mathematics, 1979
- Boolean Methods in Operations Research and Related AreasPublished by Springer Nature ,1968