X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (207) 207
Newspaper Article (75) 75
Publication (24) 24
Magazine Article (21) 21
Book / eBook (16) 16
Patent (13) 13
Conference Proceeding (12) 12
Book Chapter (6) 6
Trade Publication Article (5) 5
Report (4) 4
Dissertation (2) 2
Transcript (2) 2
Book Review (1) 1
Government Document (1) 1
Newsletter (1) 1
Paper (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
floor coverings (96) 96
operations research & management science (73) 73
algorithms (70) 70
covering (48) 48
analysis (43) 43
optimization (36) 36
computer science, interdisciplinary applications (34) 34
mathematics (34) 34
operations research (33) 33
studies (31) 31
floor coverings industry (30) 30
heuristics (29) 29
traveling salesman problem (29) 29
mathematical models (26) 26
algorithm (25) 25
combinatorics (25) 25
covering tour problem (25) 25
engineering, industrial (25) 25
computer science (23) 23
integer programming (23) 23
mathematics, applied (22) 22
management (20) 20
usage (20) 20
design (19) 19
theory of computation (16) 16
tours (16) 16
covering salesman problem (15) 15
houses (15) 15
set covering (15) 15
vehicles (15) 15
heuristic (14) 14
networks (14) 14
transportation (14) 14
councils (13) 13
models (13) 13
column generation (12) 12
graphs (12) 12
location (12) 12
management science (12) 12
operations research/decision theory (12) 12
routing (12) 12
awards & honors (11) 11
cities (11) 11
computer science, artificial intelligence (11) 11
economics / management science (11) 11
genetic algorithm (11) 11
head coverings (11) 11
mathematical analysis (11) 11
methods (11) 11
model (11) 11
operation research/decision theory (11) 11
set covering problem (11) 11
vehicle routing (11) 11
combinatorial analysis (10) 10
combinatorial optimization (10) 10
computer science, theory & methods (10) 10
education (10) 10
libraries (10) 10
logistics (10) 10
restaurants (10) 10
scheduling (10) 10
students (10) 10
vehicle-routing problem (10) 10
approximation (9) 9
approximation algorithms (9) 9
architecture (9) 9
books (9) 9
fund raising (9) 9
genetic algorithms (9) 9
hats (9) 9
headwear (9) 9
hotels & motels (9) 9
human necessities (9) 9
local search (9) 9
manufacturing (9) 9
rundfahrtproblem (9) 9
transportation science & technology (9) 9
competition (8) 8
costs (8) 8
coverage (8) 8
demand (8) 8
donations (8) 8
engineering (8) 8
facility location (8) 8
formulation (8) 8
interior design (8) 8
mathematical optimization (8) 8
meetings (8) 8
research (8) 8
art (7) 7
artificial intelligence (7) 7
athletes (7) 7
automobiles (7) 7
branch-and-cut (7) 7
children & youth (7) 7
computation (7) 7
covering tour (7) 7
executives (7) 7
furniture (7) 7
heuristic algorithms (7) 7
more...
Library Location Library Location
Library Location Library Location
X
Sort by Item Count (A-Z)
Filter by Count
Gerstein Science - Stacks (5) 5
Mathematical Sciences - Stacks (3) 3
Royal Ontario Museum - Stacks (3) 3
Collection Dvlpm't (Acquisitions) - Closed Orders (2) 2
Engineering & Comp. Sci. - Stacks (2) 2
Robarts - Stacks (2) 2
Scarborough Hospital - Birchmount (2) 2
UofT at Mississauga - Stacks (2) 2
Architecture Landscape (Shore + Moffat) - Stacks (1) 1
UofT at Mississauga - Reference (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


European Journal of Operational Research, ISSN 0377-2217, 11/2018, Volume 271, Issue 1, pp. 278 - 287
This paper introduces the Multi-Vehicle Probabilistic Covering Tour Problem (MVPCTP) which extends the Covering Tour Problem (CTP) by incorporating multiple... 
Integer programming | Covering tour | Vehicle routing | Branch-and-cut | Linearization | LOCATION | PROJECTION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | VEHICLE-ROUTING PROBLEM | FORMULATION | Usage | Linearization (Electronics) | Distribution (Probability theory) | Management | Analysis
Journal Article
Computers and Operations Research, ISSN 0305-0548, 07/2012, Volume 39, Issue 7, pp. 1582 - 1592
Journal Article
Computers and Operations Research, ISSN 0305-0548, 12/2017, Volume 88, pp. 258 - 278
The well-known multi-vehicle covering tour problem ( -CTP) involves finding a minimum-length set of vehicle routes passing through a subset of vertices,... 
Covering tour problem | Metaheuristic | Genetic algorithm | Branch-and-cut | Vehicle routing problem | Multi-covering | NUMBER | FACILITIES | DEPOT | EXACT ALGORITHM | VEHICLE-ROUTING PROBLEM | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SALESMAN | ENGINEERING, INDUSTRIAL
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 11/2019
Journal Article
Asia-Pacific Journal of Operational Research, ISSN 0217-5959, 08/2018, Volume 35, Issue 4
The multi-vehicle covering tour problem (m-CTP) is defined on a graph G - (V boolean AND W, E), where V is a set of vertices that. can be visited and W is a... 
heuristic algorithm | set-covering problem | Covering tour problem | column generation | traveling salesman problem | DELIVERY PROBLEM | ROUTES | TRAVELING-SALESMAN PROBLEM | PRICE ALGORITHM | VEHICLE-ROUTING PROBLEM | HEURISTICS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONSTRAINTS | PICKUP
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 04/2013, Volume 226, Issue 2, pp. 211 - 220
► We solve the multi-vehicle covering tour problem with particular constraints. ► We present an exact method using a branch-and-cut algorithm. ► Results for... 
Covering tour | Two-commodity flow model | Metaheuristic | Branch-and-cut | FLOW FORMULATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | POLYTOPE | FACILITIES | COEFFICIENTS | FACETS | VEHICLE-ROUTING PROBLEM | Heuristic programming | Usage | Analysis | Branch and bound algorithms | Vehicles | Computer Science | Operations Research
Journal Article
RAIRO - Operations Research, ISSN 0399-0559, 2018, Volume 52, Issue 2, pp. 577 - 594
The covering tour problem (CTP) is defined on a graph, where there exist two types of vertices. One is called visited vertex, which can be visited. The other... 
set-covering problem | Covering tour problem | traveling salesman problem | large- scale problem | local search techniques | LOCATION | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SEARCH | TRAVELING-SALESMAN PROBLEM | large-scale problem | OPTIMIZATION | Minimum cost | Production scheduling | Graph theory | Algorithms | Apexes | Heuristic methods
Journal Article
International Transactions in Operational Research, ISSN 0969-6016, 05/2017, Volume 24, Issue 3, pp. 663 - 679
The multivehicle covering tour problem (m‐CTP) is a transportation problem with different kinds of locations, where a set of locations must be visited while... 
covering tour problem | variable neighborhood search | heuristic algorithms | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MANAGEMENT | HEURISTICS | Management science | Studies | Operations research | Transportation problem (Operations research) | Transportation problem | Searching | Data sets | Tours | Covering | Traveling salesman problem | Vehicles
Journal Article
Operations Research/ Computer Science Interfaces Series, ISSN 1387-666X, 2018, Volume 62, pp. 253 - 284
Journal Article
Pesquisa Operacional, ISSN 1678-5142, 12/2015, Volume 35, Issue 3, pp. 617 - 644
ABSTRACT In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek routes that guarantee visibility,... 
OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Journal Article
Open Automation and Control Systems Journal, ISSN 1874-4443, 2014, Volume 6, Issue 1, pp. 1169 - 1175
Journal Article
Pesquisa Operacional, ISSN 0101-7438, 09/2015, Volume 35, Issue 3, pp. 617 - 644
Pesquisa Operacional (2015) 35(3): 617-644 In this paper we study a particular aspect of the urban community policing: routine patrol route planning. We seek... 
Urban patrolling | Covering tour problem | Vehicle routing | Heuristics | covering tour problem | heuristics | urban patrolling | vehicle routing
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 04/2013, Volume 226, Issue 2, pp. 211 - 220
The multi-vehicle covering tour problem (m-CTP) involves finding a minimum-length set of vehicle routes passing through a subset of vertices, subject to... 
Integer programming | Algorithms | Searching | Evolutionary | Tours | Covering | Operational research | Vehicles
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 02/2015, Volume 47, pp. 285 - 292
In this article, we consider a transportation problem with different kinds of locations: , , and . The set consists of vertices that must be visited through... 
Covering Tour Problem | variable neighborhood search | heuristic algorithms | Heuristic algorithms | Covering tour problem | Variable neighborhood search
Journal Article
2014 20th IEEE International Conference on Parallel and Distributed Systems (ICPADS), ISSN 1521-9097, 12/2014, Volume 2015-, pp. 906 - 910
This paper studies a Disk Covering Tour Problem (DCTP) for reducing the energy consumption of a mobile robot's movement to provide services for sensor nodes in... 
Wireless communication | Wireless sensor networks | Energy consumption | covering salesman problem | Heuristic algorithms | Clustering algorithms | disk covering problem | wireless sensor network | Robot sensing systems | Mobile robots | k-means algorithm | disk covering tour problem
Conference Proceeding
European Journal of Operational Research, ISSN 0377-2217, 2008, Volume 189, Issue 2, pp. 293 - 309
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 05/2015, Volume 242, Issue 3, pp. 756 - 768
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.