scientific article
From MaRDI portal
Publication:3758559
zbMath0621.90051MaRDI QIDQ3758559
Peter L. Hammer, Bruno Simeone
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
minimum cutPolynomial algorithms0-1 programmingset packingrooted treepreordersthreshold graphsorder constraintsset-coveringlinearization of pseudo-Boolean functions
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boolean programming (90C09)
Related Items
An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function, An O(m n) algorithm for regular set-covering problems, Horn functions and submodular Boolean functions, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Polyhedral results for the precedence-constrained knapsack problem, On finding connected balanced partitions of trees, Lower bound improvement and forcing rule for quadratic binary programming
