Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:58, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints |
scientific article |
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
