A method to improve integer linear programming problem with branch-and-bound procedure (Q849748): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4310697 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Evolution and state-of-the-art in integer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solution of Integer Linear Programming Problems by Direct Search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A phase-1 approach for the generalized simplex algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4692949 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3998259 / rank | |||
Normal rank | |||
Latest revision as of 22:37, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A method to improve integer linear programming problem with branch-and-bound procedure |
scientific article |
Statements
A method to improve integer linear programming problem with branch-and-bound procedure (English)
0 references
31 October 2006
0 references
duality
0 references
acceleration of computation
0 references
operations research
0 references
numerical examples
0 references
