January 25, 2023 article On the strength of recursive McCormick relaxations for binary polynomial optimization Operations Research Letters DOI: 10.1016/j.orl.2023.01.009 OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 14 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Quadratization and convexification in polynomial binary optimization 2025 Journal of Combinatorial Optimization article Mathematics Advanced Optimization Algorithms Research Open access 5 citations Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences 2024 Computers & Operations Research article Mathematics Advanced Optimization Algorithms Research Open access 4 citations Solving Unconstrained Binary Polynomial Programs with Limited Reach 2023 SSRN Electronic Journal preprint Mathematics Advanced Optimization Algorithms Research Open access 0 citations 3 results References 0