Infeasible/feasible search trajectories and directional rounding in integer programming (Q930155)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Infeasible/feasible search trajectories and directional rounding in integer programming |
scientific article; zbMATH DE number 5291490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Infeasible/feasible search trajectories and directional rounding in integer programming |
scientific article; zbMATH DE number 5291490 |
Statements
Infeasible/feasible search trajectories and directional rounding in integer programming (English)
0 references
23 June 2008
0 references
adaptive memory
0 references
0 references
0.8650272
0 references
0.8604905
0 references
0.8547018
0 references
0.8537407
0 references
0.8534651
0 references
