Pages that link to "Item:Q1025998"

The following pages link to A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998):

Displayed 2 items.

• An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) ‎ (← links)
• On interval-subgradient and no-good cuts (Q613320) ‎ (← links)