EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Capacitated m-Ring-Star Problem"
Narrow search

Narrow search

Year of publication
Subject
All
Capacitated m-Ring-Star Problem 1 Heuristic algorithms 1 Integer Linear Programming 1 Local search 1 Variable Neighborhood Search 1
Online availability
All
Undetermined 1
Type of publication
All
Article 1
Language
All
Undetermined 1
Author
All
Naji-Azimi, Zahra 1 Salari, Majid 1 Toth, Paolo 1
Published in...
All
European Journal of Operational Research 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem
Naji-Azimi, Zahra; Salari, Majid; Toth, Paolo - In: European Journal of Operational Research 217 (2012) 1, pp. 17-25
We address the Capacitated m-Ring-Star Problem in which the aim is to find m rings (simple cycles) visiting a central … allocation costs. The Capacitated m-Ring-Star Problem is NP-hard, since it generalizes the Traveling Salesman Problem. …
Persistent link: https://www.econbiz.de/10011052628
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...