A simple, all primal branch and bound approach to pure and mixed integer binary programs (Q1835845): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 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.1016/0167-6377(82)90036-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004980487 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Investigation of some branch and bound strategies for the solution of mixed integer linear programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3214706 / rank | |||
Normal rank | |||
Latest revision as of 16:59, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple, all primal branch and bound approach to pure and mixed integer binary programs |
scientific article |
Statements
A simple, all primal branch and bound approach to pure and mixed integer binary programs (English)
0 references
1982
0 references
branch-and-bound
0 references
computational experience
0 references
primal feasibility preservation
0 references
