Towards a closer integration of finite domain propagation and simplex-based algorithms (Q1265905)
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: Towards a closer integration of finite domain propagation and simplex-based algorithms |
scientific article; zbMATH DE number 1202752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a closer integration of finite domain propagation and simplex-based algorithms |
scientific article; zbMATH DE number 1202752 |
Statements
Towards a closer integration of finite domain propagation and simplex-based algorithms (English)
0 references
27 September 1998
0 references
combinatorial optimization
0 references
constraint satisfaction
0 references
finite domain propagation
0 references
simplex method
0 references
integer programming
0 references
branch-and-bound
0 references
0.8370382
0 references
0.8321531
0 references
0.8305692
0 references
0.8273566
0 references
0.8266521
0 references
0.8257689
0 references
