Pages that link to "Item:Q453612"

The following pages link to Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612):

Displaying 9 items.

• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
• Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
• Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
• Extended formulations for convex envelopes (Q486393) (← links)
• Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs (Q652688) (← links)
• Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
• A global optimization framework for distributed antenna location in CDMA cellular networks (Q2399315) (← links)
• Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
• Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)