A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467)
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: A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem |
scientific article; zbMATH DE number 6599289
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem |
scientific article; zbMATH DE number 6599289 |
Statements
29 June 2016
0 references
decision analysis
0 references
multiple criteria
0 references
programming
0 references
integer
0 references
algorithm
0 references
cutting plane
0 references
networks-graphs
0 references
traveling salesman
0 references
0 references
0 references
0 references
0 references
A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (English)
0 references
0.7887238264083862
0 references
0.757409930229187
0 references
0.7511447072029114
0 references
0.7504273056983948
0 references
0.7498384714126587
0 references
