Pseudo-Boolean optimization
Top Cited Papers
- 28 December 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 123 (1-3) , 155-225
- https://doi.org/10.1016/s0166-218x(01)00341-9
Abstract
No abstract availableKeywords
This publication has 123 references indexed in Scilit:
- Algorithms for minclique scheduling problemsDiscrete Applied Mathematics, 1997
- Polynomially solvable cases for the maximum stable set problemDiscrete Applied Mathematics, 1995
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problemsAnnals of Operations Research, 1995
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Upper-bounds for quadratic 0–1 maximizationOperations Research Letters, 1990
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Strong unimodularity for matrices and hypergraphsDiscrete Applied Mathematics, 1986
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functionsDiscrete Applied Mathematics, 1985
- Solving satisfiability in less than 2n stepsDiscrete Applied Mathematics, 1985
- Cluster Analysis and Mathematical ProgrammingJournal of the American Statistical Association, 1971