Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252)
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: Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem |
scientific article; zbMATH DE number 6872239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem |
scientific article; zbMATH DE number 6872239 |
Statements
Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (English)
0 references
24 May 2018
0 references
air traffic control
0 references
conflict resolution
0 references
mixed integer linear optimization
0 references
minimum weight maximum clique
0 references
decomposition methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9036167860031128
0 references
0.7801095247268677
0 references
0.7786909937858582
0 references
0.7764164805412292
0 references
