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:"NP‐complete problem"
Narrow search

Narrow search

Year of publication
Subject
All
NP-complete problem 2 approximation algorithm 2 traveling salesman 2 Algorithm 1 Algorithmus 1 Container terminal 1 Container transport 1 Containerterminal 1 Containerverkehr 1 Maritime container terminal 1 Mathematical programming 1 Mathematische Optimierung 1 NP‐complete problem 1 Scheduling problem 1 Scheduling-Verfahren 1 Tabu Search algorithm 1 Theorie 1 Theory 1 containers 1 location assignment 1 meta‐heuristic 1 multi‐objective optimization 1 scheduling 1 straddle carriers 1
more ... less ...
Online availability
All
Undetermined 3
Type of publication
All
Article 3
Type of publication (narrower categories)
All
Article in journal 1 Aufsatz in Zeitschrift 1
Language
All
Undetermined 2 English 1
Author
All
Monnot, Jérôme 2 Paschos, Vangelis Th. 2 Toulouse, Sophie 2 Chabchoub, Habib 1 Dkhil, Hamdi 1 Yassine, Adnan 1
Published in...
All
Computational Statistics 1 Journal of the Operational Research Society 1 Mathematical Methods of Operations Research 1
Source
All
RePEc 2 ECONIS (ZBW) 1
Showing 1 - 3 of 3
Cover Image
Multi-objective optimization of the integrated problem of location assignment and straddle carrier scheduling in maritime container terminal at import
Dkhil, Hamdi; Yassine, Adnan; Chabchoub, Habib - In: Journal of the Operational Research Society 69 (2018) 2, pp. 247-269
Persistent link: https://www.econbiz.de/10012224959
Saved in:
Cover Image
Approximation algorithms for the traveling salesman problem
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie - In: Computational Statistics 56 (2003) 3, pp. 387-405
We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called...
Persistent link: https://www.econbiz.de/10010848018
Saved in:
Cover Image
Approximation algorithms for the traveling salesman problem
Monnot, Jérôme; Paschos, Vangelis Th.; Toulouse, Sophie - In: Mathematical Methods of Operations Research 56 (2003) 3, pp. 387-405
We first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called...
Persistent link: https://www.econbiz.de/10011000013
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...