Dataset - CKAN

Compact relaxations for polynomial programming problems

Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer)...
- HTML
Reduced RLT constraints for polynomial programming

International audience
- HTML

You can also access this registry using the API (see API Docs).

2 datasets found