The set orienteering problem (Q1754239): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 17:30, 15 July 2024

scientific article

Language	Label	Description	Also known as
English	The set orienteering problem	scientific article

Statements

scholarly article

0 references

The set orienteering problem (English)

0 references

Claudia Archetti

0 references

Francesco Carrabs

0 references

Raffaele Cerulli

0 references

European Journal of Operational Research

0 references

publication date

30 May 2018

0 references

zbMATH Keywords

routing

0 references

orienteering problem

0 references

matheuristic

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2017.11.009

0 references

The clustered orienteering problem

0 references

0 references

Vehicle Routing

0 references

A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem

0 references

A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem

0 references

Orienteering problem: a survey of recent variants, solution approaches and applications

0 references

Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach

0 references

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

0 references

A comparative analysis of several asymmetric traveling salesman problem formulations

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2017.11.009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1754239

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1754239&oldid=36394315"