- Tài khoản và mật khẩu chỉ cung cấp cho sinh viên, giảng viên, cán bộ của TRƯỜNG ĐẠI HỌC FPT
Xem Video
.
Tại đây
.
Đăng nhập
:
Tại đây
.
FPT University|e-Resources >
Bài báo khoa học (Scientific Articles) >
Articles published by FPT lecturers >
Please use this identifier to cite or link to this item:
http://ds.libol.fpt.edu.vn/handle/123456789/1991
Title: Solving the close‐enough arc routing problem Authors: Minh, Hoang Ha Bostel, Nathalie Langevin, André Rousseau, Louis-Martin Keywords: Close-enough arc routing problem Issue Date: 1-Jan-2014 Abstract: Abstract The close-enough arc routing problem has an interesting real-life application to
routing for meter reading. In this article, we propose a new mathematical formulation for this
problem. We analyze our formulation and compare it with two formulations in the literature.
We also develop branch-and-cut algorithms to solve the problem to optimality. We present
computational results for instances based on three types of graphs: directed, undirected, and
mixed. Copyright© 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 63 (1), 107–118 2014 Description: 11 pages URI: http://ds.libol.fpt.edu.vn/handle/123456789/1991 Appears in Collections: Articles published by FPT lecturers
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
UniKey
Font ABC-VNI
WinRAR
Flashget v3.3
Mozilla Firefox
Foxit Reader 5
HƯỚNG DẪN SỬ DỤNG
GỬI YÊU CẦU
