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

This publication has 10 references indexed in Scilit:

• Accelerated greedy algorithms for maximizing submodular set functions
  Published by Springer Nature ,2005
• Roof duality, complementation and persistency in quadratic 0–1 optimization
  Mathematical Programming, 1984
• Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléenne
  Rairo-Operations Research, 1983
• The ellipsoid method and its consequences in combinatorial optimization
  Combinatorica, 1981
• Graphes et algorithmes: M. GONDRAN and M. MINOUX Volume 37 in: Collection de la Direction des Études et Recherches d'Électricité de France, Eyrolles, Paris, 1979, xxvii + 518 pages, FF 360.-
  European Journal of Operational Research, 1981
• An analysis of approximations for maximizing submodular set functions—I
  Mathematical Programming, 1978
• Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”
  SIAM Journal on Computing, 1977
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
  SIAM Journal on Computing, 1975
• A Selection Problem of Shared Fixed Costs and Network Flows
  Management Science, 1970
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965