On the facets of the mixed-integer knapsack polyhedron (Q1424283): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q163008 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Atamtürk, Alper / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: MIPLIB / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10107-003-0400-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1549174816 / rank | |||
Normal rank |
Latest revision as of 22:37, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the facets of the mixed-integer knapsack polyhedron |
scientific article |
Statements
On the facets of the mixed-integer knapsack polyhedron (English)
0 references
11 March 2004
0 references
The author studies the mixed-integer knapsack polyhedron, which is the convex hull of the mixed-integer set defined by an arbitrary linear inequality and the bounds of the variables. The faces of the mixed-integer knapsack polyhedron are described through superadditive function and are closely related to the mixed-integer programming (MIP) inequalities. These new inequalities strengthen and/or generalize known inequalities for special cases of mixed-integer knapsack set studied earlier. In the last section the author presents a summary of computational experiments, which suggest that the new inequalities can be useful in a branch-and-cut algorithm for mixed-integer programming.
0 references
mixed-integer programming
0 references
knapsack set
0 references
polyhedral theory
0 references
lifting
0 references