X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (5410) 5410
Conference Proceeding (1484) 1484
Publication (329) 329
Book Chapter (144) 144
Dissertation (94) 94
Newspaper Article (34) 34
Magazine Article (31) 31
Government Document (14) 14
Book / eBook (7) 7
Paper (3) 3
Standard (3) 3
Trade Publication Article (3) 3
Reference (2) 2
Book Review (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
algorithms (2546) 2546
shortest-path problems (2491) 2491
optimization (1049) 1049
shortest path (1043) 1043
networks (936) 936
shortest path problem (885) 885
routing (812) 812
operations research & management science (757) 757
computer science (753) 753
shortest paths (691) 691
analysis (637) 637
mathematics, applied (565) 565
graphs (560) 560
studies (531) 531
mathematical models (525) 525
computer science, theory & methods (507) 507
algorithm (504) 504
computer simulation (500) 500
engineering, electrical & electronic (468) 468
graph theory (456) 456
mathematical analysis (419) 419
computer networks (394) 394
computer science, information systems (363) 363
mathematics (353) 353
transportation (311) 311
dynamic programming (292) 292
telecommunications (280) 280
computer science, hardware & architecture (274) 274
computation (272) 272
roads (271) 271
shortest path algorithms (264) 264
algorithm design and analysis (263) 263
computer science, artificial intelligence (248) 248
computer science, interdisciplinary applications (239) 239
artificial intelligence (229) 229
research (226) 226
computer science, software engineering (220) 220
transportation science & technology (220) 220
shortest-path problem (219) 219
usage (218) 218
operations research (216) 216
approximation (198) 198
complexity (194) 194
heuristic algorithms (170) 170
models (162) 162
vehicles (156) 156
costs (155) 155
approximation algorithms (153) 153
methods (148) 148
network (141) 141
shortest-path (133) 133
wireless networks (133) 133
theory of computation (128) 128
engineering (127) 127
column generation (125) 125
path planning (124) 124
delay (123) 123
genetic algorithms (123) 123
searching (123) 123
ant colony optimization (118) 118
trees (117) 117
genetic algorithm (115) 115
model (115) 115
dynamics (112) 112
topology (112) 112
robots (111) 111
index medicus (110) 110
polynomials (107) 107
clustering (104) 104
computational geometry (104) 104
engineering, civil (104) 104
combinatorial optimization (100) 100
wireless sensor networks (100) 100
automation & control systems (98) 98
route planning (98) 98
mathematical optimization (96) 96
algorithm analysis and problem complexity (94) 94
integer programming (94) 94
scheduling (94) 94
strategy (94) 94
heuristic (93) 93
navigation (93) 93
computer communication networks (91) 91
linear programming (89) 89
operations research/decision theory (88) 88
management (87) 87
traffic flow (87) 87
engineering, industrial (84) 84
travel time (84) 84
nodes (83) 83
neural networks (78) 78
combinatorial analysis (77) 77
ad hoc networks (74) 74
internet (74) 74
combinatorics (73) 73
robotics (71) 71
traveling salesman problem (70) 70
computational modeling (69) 69
construction (69) 69
dijkstra's algorithm (69) 69
more...
Library Location Library Location
Language Language
Language Language
X
Sort by Item Count (A-Z)
Filter by Count
English (6252) 6252
Chinese (461) 461
Japanese (85) 85
Indonesian (3) 3
Persian (3) 3
Russian (3) 3
French (2) 2
Spanish (2) 2
Turkish (2) 2
German (1) 1
Korean (1) 1
Portuguese (1) 1
more...
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Theoretical Computer Science, ISSN 0304-3975, 06/2012, Volume 439, pp. 9 - 15
We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and... 
Cographs | Independent set | Perfect graphs | Even-hole-free graphs | Reconfiguration | COLORINGS | RECOGNITION ALGORITHM | SHORTEST PATHS | COMPUTER SCIENCE, THEORY & METHODS | GRAPHS | Analysis | Algorithms | Computer simulation | Shortest-path problems | Graphs | Sliding | Mathematical models | Jumping | Complexity
Journal Article
Networks, ISSN 0028-3045, 03/2019, Volume 73, Issue 2, pp. 187 - 205
Bidirectional dynamic programming is an algorithm that searches for paths in a network from both the starting and the ending nodes that optimize a given... 
dynamic programming | bidirectional | resource constraints | shortest paths | Dijkstra | heuristic search | ROUTE | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | RELAXATION | EXACT ALGORITHM | STRATEGIES | Algorithms | Sensitivity analysis | Dynamic programming | Shortest-path problems
Journal Article
Computers and Mathematics with Applications, ISSN 0898-1221, 2011, Volume 62, Issue 6, pp. 2591 - 2600
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of... 
Shortest path problem | Uncertain programming | Uncertainty theory | Dijkstra algorithm | MATHEMATICS, APPLIED | Algorithms | Networks | Uncertainty | Construction | Law | Shortest-path problems | Tools | Mathematical models
Journal Article
IEEE Transactions on Automatic Control, ISSN 0018-9286, 11/2018, Volume 63, Issue 11, pp. 3787 - 3792
Journal Article
Parallel Computing, ISSN 0167-8191, 2010, Volume 36, Issue 5, pp. 241 - 253
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of... 
Matrix multiplication | Gaussian elimination | All-pairs shortest-paths | Linear algebra | Shortest path | Semiring | Graphical processing unit | Graph algorithm | SHORTEST-PATH | COMPUTER SCIENCE, THEORY & METHODS | ALGORITHMS | Multiplication | Algorithms | Computation | Bandwidth | Shortest-path problems | Iterative algorithms | Programmers | Harnesses
Journal Article
Journal of the ACM (JACM), ISSN 0004-5411, 09/2018, Volume 65, Issue 5, pp. 1 - 38
We say an algorithm on n × n matrices with integer entries in [− M , M ] (or n -node graphs with edge weights from [− M , M ]) is truly subcubic if it runs in... 
all-pairs shortest paths | subcubic time | Fine-grained complexity | fine-grained reductions | equivalences | Fine-grained reductions | All-pairs shortest paths | Subcubic time | Equivalences
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 08/2016, Volume 252, Issue 3, pp. 995 - 1018
Journal Article
Computers and Operations Research, ISSN 0305-0548, 2009, Volume 36, Issue 4, pp. 1299 - 1331
Journal Article
Transportation Research Part B, ISSN 0191-2615, 04/2016, Volume 86, pp. 163 - 180
Journal Article
Computers and Operations Research, ISSN 0305-0548, 09/2017, Volume 85, pp. 1 - 11
•A new minmax regret optimization model that takes into account the possibility of modify the system by investing in the basic cost structure is proposed.•The... 
Shortest path problem | Robustness and sensitivity analysis | Minmax regret models | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | INTERVAL DATA | ENGINEERING, INDUSTRIAL | Investments | Analysis | Management science
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 06/2016, Volume 251, Issue 3, pp. 739 - 750
•We present two decomposition approaches for recoverable robust optimization.•We prove that the LP-relaxation of one of the two models is stronger than the... 
Recoverable robustness | Shortest path | Column generation | Knapsack | Branch-and-price | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PRICE | Problem solving | Algorithms | Mathematical optimization | Analysis | Decomposition method | Disturbances | Programming | Strategy | Robustness | Decomposition | Recovery | Cost engineering | Optimization
Journal Article
Computational Geometry: Theory and Applications, ISSN 0925-7721, 11/2019, Volume 84, pp. 12 - 21
We introduce a variant of the watchman route problem, which we call the quickest pair-visibility problem. Given two persons standing at points s and t in a... 
Shortest path | Visibility polygon | Watchman problems | MATHEMATICS | MATHEMATICS, APPLIED | VISIBILITY | SHORTEST-PATH QUERIES | Computer science
Journal Article
Water Resources Research, ISSN 0043-1397, 08/2011, Volume 47, Issue 8, p. n/a
Even deterministic reservoir operation problems with a single objective function may have multiple near‐optimal solutions (MNOS) whose objective values are... 
genetic algorithm | reservoir operation | dynamic programming | near‐optimal solutions | near‐shortest paths | Markov chain Monte Carlo | SHORTEST | ENVIRONMENTAL SCIENCES | MANAGEMENT | MODELS | SYSTEMS | WATER RESOURCES | OPTIMIZATION | LIMNOLOGY | RULES | GENETIC ALGORITHM | Hydrology | Reservoirs
Journal Article
Transportation Research Part B, ISSN 0191-2615, 2006, Volume 40, Issue 2, pp. 93 - 122
We study optimal routing policy problems in stochastic time-dependent networks, where link travel times are modeled as random variables with time-dependent... 
Adaptive routing | Dynamic | Stochastic | Routing policy | Network optimization | TRANSPORTATION | adaptive routing | VARYING TRANSPORTATION | ALGORITHM | network optimization | SHORTEST-PATH PROBLEM | ENGINEERING, CIVIL | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | routing policy | TRANSPORTATION SCIENCE & TECHNOLOGY | stochastic | dynamic | ECONOMICS | Analysis | Algorithms
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 04/2017, Volume 258, Issue 1, pp. 58 - 69
•We analyze the minmax regret objective function for ellipsoidal uncertainty sets.•The complexity of evaluating a solution and finding the best solution is... 
Minmax regret | Ellipsoidal uncertainty | Robust optimization | Scenario relaxation | Complexity | SHORTEST-PATH PROBLEM | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | APPROXIMATION | MAX | ALGORITHM | INTERVAL DATA | VERSIONS | Problem solving | Mathematical optimization | Analysis
Journal Article