POLIPlibrary for polynomially constrained
| ||
Displaying instances of type portfolio.
Filter by type:Status:
instance can be solved within an hour with a general-purpose solver
(to a final gap of at least 0.1%)
instance has been solved (to a final gap of at least 0.1%, possibly by a problem-specific algorithm)
optimal solution to instance is unknown
Classification:
A|BC|D where
A is problem type: c (convex) or nc (nonconvex),
B is type of linear variables (i.e. only appearing in linear terms): b (only binary), i (only binary or general integers), c (also continuous), or 0 if none
C is type of nonlinear variables (i.e. appearing in nonlinear terms): b (only binary), i (only binary or general integers), c (also continuous), or 0 if none, and
D is maximum degree of the polynomials.
© by maintainers | last update : 2011-06-02 19:16:37 +0200 (Do, 02. Jun 2011) $ by : marc.pfetsch $ | imprint