Strong relaxations for continuous nonlinear programs based on decision diagrams

DOI10.1016/j.orl.2021.01.011OpenAlexW3121525042MaRDI QIDQ2661626

Danial Davarnia

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.01.011

zbMATH Keywords

outer approximationcutting planesdecision diagramsmixed integer and nonlinear programs

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Cites Work

• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Outer approximation for integer nonlinear programs via decision diagrams
• Discrete Optimization with Decision Diagrams
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Target Cuts from Relaxed Decision Diagrams
• Multivalued Decision Diagrams for Sequencing Problems
• Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction

This page was built for publication: Strong relaxations for continuous nonlinear programs based on decision diagrams