A bounded dual (all-integer) integer programming algorithm with an objective cut (Q3316963): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1002/nav.3800300208 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2126369429 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5595961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4077727 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A primal (all-integer) integer programming algorithm / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:06, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bounded dual (all-integer) integer programming algorithm with an objective cut |
scientific article |
Statements
A bounded dual (all-integer) integer programming algorithm with an objective cut (English)
0 references
1983
0 references
comparison of algorithms
0 references
convergence analysis
0 references
all integer cutting plane algorithm
0 references
integral upper bounds
0 references
Computational tests
0 references
