Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions-Reference-Cited by-同舟云学术

Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions

Published:1985-09 Issue:1 Volume:12 Page:1-11
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Billionnet A.,Minoux M.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference18 articles.

1. Comments of F. Hadlock's paper: finding a maximum cut of a planar graph in polynomial time;Aoshima;SIAM J. Comput.,1977

2. Graphes et Hypergraphes;Berge,1970

3. Algorithmes gluotons et fonctions surmodulaires: théorie et application à un problème de sécurité dans les réseaux de Télécommunications;Biesel-Guitonneau;Ann. Télécommunications,1980

4. Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléene;Billionnet;RAIRO (série verte),1983

5. Linear Programming and Extensions;Dantzig,1963

Cited by 50 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Submodular maximization and its generalization through an intersection cut lens;Mathematical Programming;2024-02-19

2. A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization;Theoretical Computer Science;2020-10

3. Unsupervised Image Matching and Object Discovery as Optimization;2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR);2019-06

4. Cascading Edge Failures: A Dynamic Network Process;IEEE Transactions on Network Science and Engineering;2018-10-01

5. On a general framework for network representability in discrete optimization;Journal of Combinatorial Optimization;2017-05-20