tic-tac-toe_q
POLIPlibrary for polynomially constrained
| ||
tic-tac-toe_q| Name | tic-tac-toe_q |
| Classification | nc|bc|d2 |
| Problem type | maxfs |
| Description | Bilinear model for the MaxFS instance tic-tac-toe_q |
| Objective sense | min |
| Variables | 2884 (958 binary, 0 general integer, 1926 continuous) |
| Nonlinear variables | 1926 |
| Constraints | 1916 |
| Nonlinear constraints | 958 |
| Linear nonzeros | 10139 |
| Nonlinear nonzeros | 958 |
| Download | tic-tac-toe_q.pip.gz tic-tac-toe_q.gms.gz tic-tac-toe_q.mod.gz |
| Best known solution | |
| Best known objective | |
| Best known bound | |
| Originator | Marc Pfetsch |
| Formulator | Marc Pfetsch |
| Donator | Marc Pfetsch |
| References |