Solving relaxation orienteering problem using DCA-CUT (Q5356984)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6774377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving relaxation orienteering problem using DCA-CUT |
scientific article; zbMATH DE number 6774377 |
Statements
Solving Relaxation Orienteering Problem Using DCA-CUT (English)
0 references
12 September 2017
0 references
orienteering problem
0 references
DC programming
0 references
DC algorithm
0 references
binary linear integer program
0 references
0.7890623211860657
0 references
0.7838267087936401
0 references
0.7791598439216614
0 references
0.7763988971710205
0 references
0.7732082009315491
0 references
