scientific article; zbMATH DE number 4008098

zbMATH Open0621.90051MaRDI QIDQ3758559FDOQ3758559

Authors: Peter L. Hammer, Bruno Simeone 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• Publication:3035138
• Publication:3481487
• An ordering (enumerative) algorithm for nonlinear \(0-1\) programming
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• Nonlinear 0–1 programming: I. Linearization techniques

zbMATH Keywords

order constraintsminimum cutpreordersthreshold graphsset packing0-1 programmingrooted treePolynomial algorithmsset-coveringlinearization of pseudo-Boolean functions

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Boolean programming (90C09)

Cited In (11)

• Polyhedral results for the precedence-constrained knapsack problem
• Title not available (Why is that?)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• On finding connected balanced partitions of trees
• Title not available (Why is that?)
• Horn functions and submodular Boolean functions
• Lower bound improvement and forcing rule for quadratic binary programming
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
• An ordering (enumerative) algorithm for nonlinear \(0-1\) programming
• An O(m n) algorithm for regular set-covering problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758559)