Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Feasible partition problem in reverse convex and convex mixed-integer programming |
scientific article; zbMATH DE number 6405980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasible partition problem in reverse convex and convex mixed-integer programming |
scientific article; zbMATH DE number 6405980 |
Statements
Feasible partition problem in reverse convex and convex mixed-integer programming (English)
0 references
19 February 2015
0 references
integer programming
0 references
infeasibility
0 references
reverse convex and convex constraints
0 references
feasible partition and maximal consistent partition problem
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7710022330284119
0 references
0.7502917051315308
0 references
0.7424827814102173
0 references
