scientific article; zbMATH DE number 4008098
From MaRDI portal
Publication:3758559
Recommendations
Cited in
(11)- Polyhedral results for the precedence-constrained knapsack problem
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Horn functions and submodular Boolean functions
- An O(m n) algorithm for regular set-covering problems
- On finding connected balanced partitions of trees
- Lower bound improvement and forcing rule for quadratic binary programming
- scientific article; zbMATH DE number 4133831 (Why is no real title available?)
- An ordering (enumerative) algorithm for nonlinear \(0-1\) programming
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
- scientific article; zbMATH DE number 4152147 (Why is no real title available?)
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
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)