Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6153544
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints |
scientific article; zbMATH DE number 6153544 |
Statements
Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (English)
0 references
12 April 2013
0 references
piecewise linear optimization
0 references
mixed-integer programming
0 references
knapsack problem
0 references
special ordered set
0 references
semi-continuous variable
0 references
polyhedral method
0 references
branch-and-cut
0 references
90
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8230542540550232
0 references
0.8144130706787109
0 references
0.8085786700248718
0 references
0.7951421141624451
0 references
0.7578790783882141
0 references
