Narrow search
Showing 1 - 10 of 1,808
Cover Image
Entscheidungsfreiheit als Grundlage wirtschaftswissenschaftlicher Forschung
Küpper, Hans-Ulrich - Volkswirtschaftliche Fakultät, … - 2006
This paper analyses whether freedom of decision as a crucial precondition of normative deci-sion theory is questioned … by ethics and neurobiology. It argues for an understanding of busi-ness ethics which sees the economic agents’ freedom of … plain determination on the one extreme and complete autonomy on the other. It supports the proposition in decision theory …
Persistent link: https://www.econbiz.de/10005649761
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
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
Cover Image
How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates
Srour, F.J.; Zuidwijk, R.A. - Erasmus Research Institute of Management (ERIM), ERIM … - 2008
In this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two disclosure dates. This problem, a variant of the online TSP with release dates, is characterized by the disclosure of a job’s location at one point in time followed by the...
Persistent link: https://www.econbiz.de/10005288451
Cover Image
How Much is Location Information Worth? A Competitive Analysis of the Online Traveling Salesman Problem with Two Disclosure Dates
Srour, Srour, F.J.; Zuidwijk, Zuidwijk, R.A. - Erasmus Research Institute of Management (ERIM), … - 2008
In this paper we derive the worst-case ratio of an online algorithm for the Traveling Salesman Problem (TSP) with two disclosure dates. This problem, a variant of the online TSP with release dates, is characterized by the disclosure of a job’s location at one point in time followed by the...
Persistent link: https://www.econbiz.de/10010731161
Cover Image
The bike sharing rebalancing problem: Mathematical formulations and benchmark instances
Dell'Amico, Mauro; Hadjicostantinou, Eleni; Iori, Manuel; … - In: Omega 45 (2014) C, pp. 7-19
Bike sharing systems offer a mobility service whereby public bicycles, located at different stations across an urban area, are available for shared use. These systems contribute towards obtaining a more sustainable mobility and decreasing traffic and pollution caused by car transportation. Since...
Persistent link: https://www.econbiz.de/10010870986
Cover Image
Routing problems with loading constraints
Iori, Manuel; Martello, Silvano - In: TOP: An Official Journal of the Spanish Society of … 18 (2010) 1, pp. 4-27
Persistent link: https://www.econbiz.de/10008456006
Cover Image
Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem
Yu, Wei; Liu, Zhaohui; Bao, Xiaoguang - In: European Journal of Operational Research 238 (2014) 3, pp. 735-740
This paper is concerned with the Online Quota Traveling Salesman Problem. Depending on the symmetry of the metric and the requirement for the salesman to return to the origin, four variants are analyzed. We present optimal deterministic algorithms for each variant defined on a general space, a...
Persistent link: https://www.econbiz.de/10010785317
Cover Image
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria; Pessoa, Artur Alves; Subramanian, Anand; … - In: European Journal of Operational Research 235 (2014) 1, pp. 115-128
This paper deals with the Traveling Salesman Problem (TSP) with Draft Limits (TSPDL), which is a variant of the well-known TSP in the context of maritime transportation. In this recently proposed problem, draft limits are imposed due to restrictions on the port infrastructures. Exact algorithms...
Persistent link: https://www.econbiz.de/10010744216
Cover Image
Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
Cheang, Brenda; Gao, Xiang; Lim, Andrew; Qin, Hu; Zhu, … - In: European Journal of Operational Research 223 (2012) 1, pp. 60-75
We extend the traveling salesman problem with pickup and delivery and LIFO loading (TSPPDL) by considering two additional factors, namely the use of multiple vehicles and a limitation on the total distance that a vehicle can travel; both of these factors occur commonly in practice. We call the...
Persistent link: https://www.econbiz.de/10010597660