A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1287/ijoc.1110.0476 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/IJOC.1110.0476 / rank | |||
Normal rank | |||
Latest revision as of 00:41, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem |
scientific article |
Statements
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (English)
0 references
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
