Note—Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems

DOI10.1287/MNSC.28.7.829MaRDI QIDQ3941192zbMATH OpenOpenAlexFDO

Authors Frieda Granot

Publication date 1982

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.28.7.829

zbMATH Keywords

computational studyheuristic methodspositive 0-1 polynomial programmingrandomly generated sparse problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Cited in

(1)

• Heuristic methods and applications: A categorized survey

This page was built for publication: Note—Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems

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