Search results for "shortest-path problem"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Rong Long Wang, Shan-Shan Guo, Kozo Okazaki	A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network.	Soft Comput.	2009	DBLP DOI BibTeX RDF	Hill-jump algorithm, Hopfield neural network, Shortest path problem, Combinatorial optimization problem, Local minimum
3	Eliécer Gutiérrez, Andrés L. Medaglia	Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks.	Annals OR	2008	DBLP DOI BibTeX RDF	Turn prohibitions, Geographic information systems (GIS), Combinatorial optimization, Road networks, Shortest path problem
3	Tetz C. Huang	An efficient fault-containing self-stabilizing algorithm for the shortest path problem.	Distributed Computing	2006	DBLP DOI BibTeX RDF	Single-fault situation, Stabilization time, Shortest path problem, Fault-containment, Self-stabilizing algorithm
3	Ketan Mulmuley, Pradyut Shah	A Lower Bound for the Shortest Path Problem. (PDF / PS)	IEEE Conference on Computational Complexity	2000	DBLP DOI BibTeX RDF	parallel, lower bound, shortest path problem
3	Xuedong Jiang, Tao Yang	Heuristic algorithms for path selection in private ATM networks.	ICCCN	1997	DBLP DOI BibTeX RDF	private ATM networks, minimum hop path, end-to-end delay requirement, maximum load level, unconstrained shortest path problem, randomly generated networks, call blocking ratio, link metric, performance, asynchronous transfer mode, probability, call admission control, heuristic algorithms, network routing, NP-complete problem, simulation study, shortest path problem, path selection, multiple constraints
2	Chiun-Chieh Hsu, Da-Ren Chen, Hua-Yuan Ding	An Efficient Algorithm for the Shortest Path Problem with Forbidden Paths.	ICA3PP	2009	DBLP DOI BibTeX RDF	Forbidden paths, Shortest paths, Network flows, Labeling algorithm
2	Silvana Petruseva	Forward Chaining Algorithm for Solving the Shortest Path Problem in Arbitrary Deterministic Environment in Linear Time - Applied for the Tower of Hanoi Problem.	KI	2009	DBLP DOI BibTeX RDF
2	Maria Flavia Monaco, Marcello Sammarra, Luigi Moccia	Some observations about the extreme points of the Generalized Cardinality-Constrained Shortest Path Problem polytope.	Optimization Letters	2008	DBLP DOI BibTeX RDF	Basic solutions, Polytopes, Extreme points, Constrained shortest path
2	Matheus Giovanni Pires, Ivan Nunes da Silva, Fabiana Cristina Bertoni	Solving Shortest Path Problem Using Hopfield Networks and Genetic Algorithms.	HIS	2008	DBLP DOI BibTeX RDF	genetic algorithm, dynamic programming, shortest path problem, Hopfield network
2	Sascha Häckel, Marco Fischer, David Zechel, Tobias Teich	A multi-objective ant colony approach for pareto-optimization using dynamic programming.	GECCO	2008	DBLP DOI BibTeX RDF	dynamic programming, multi-objective optimization, ant colony optimization, hybridization, pareto-optimization, shortest-path problem
2	Saeedeh Momtazi, Somayeh Kafi, Hamid Beigy	Solving Stochastic Path Problem: Particle Swarm Optimization Approach.	IEA/AIE	2008	DBLP DOI BibTeX RDF	Stochastic Shortest Path Problem, Particle Swarm Optimization, Swarm Intelligence
2	Sudha Rani Kolavali, Shalabh Bhatnagar	Ant Colony Optimization Algorithms for Shortest Path Problems.	NET-COOP	2008	DBLP DOI BibTeX RDF	multi-stage shortest path problem, Ant colony optimization, stochastic approximation
2	Dan He	BMA*: An Efficient Algorithm for the One-to-Some Shortest Path Problem on Road Maps.	AAIM	2007	DBLP DOI BibTeX RDF
2	Benjamin Doerr, Edda Happ, Christian Klein	A tight analysis of the (1 + 1)-EA for the single source shortest path problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
2	Sung-Chul Han, Franz Franchetti, Markus Püschel	Program generation for the all-pairs shortest path problem.	PACT	2006	DBLP DOI BibTeX RDF	Floyd-Warshall algorithm, SIMD vectorization, empirical search, tiling, blocking
2	Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki Khalid	Hybrid Concentration-Controlled Direct-Proportional Length-Based DNA Computing for Numerical Optimization of the Shortest Path Problem.	BioADIT	2006	DBLP DOI BibTeX RDF
2	András György, Tamás Linder, György Ottucsák	The Shortest Path Problem Under Partial Monitoring.	COLT	2006	DBLP DOI BibTeX RDF
2	Parham Pahlavani, Farhad Samadzadegan, Mahmood Reza Delavar	A GIS-Based Approach for Urban Multi-criteria Quasi Optimized Route Guidance by Considering Unspecified Site Satisfaction.	GIScience	2006	DBLP DOI BibTeX RDF	Multi-criteria shortest path problem, GIS, Network analysis, Multi objective Genetic algorithm
2	Xavier Gandibleux, Frédéric Beugnies, Sabine Randriamasy	Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function.	4OR	2006	DBLP DOI BibTeX RDF	shortest path problem, labelling algorithm, Multi-objective combinatorial optimization
2	Roberto Montemanni, Luca Maria Gambardella	The robust shortest path problem with interval data via Benders decomposition.	4OR	2005	DBLP DOI BibTeX RDF	robust optimization, Shortest path problem, Benders decomposition, interval data
2	Tzung-Nan Chuang, Jung-Yuan Kung	A new approach for the fuzzy shortest path problem.	Computational Intelligence for Modelling and Prediction	2005	DBLP DOI BibTeX RDF
2	Thorsten Gellermann, Meinolf Sellmann, Robert Wright	Shorter Path Constraints for the Resource Constrained Shortest Path Problem.	CPAIOR	2005	DBLP DOI BibTeX RDF
2	Ramkumar Ramaswamy, James B. Orlin, Nilopal Chakravarti	Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs.	Math. Program.	2005	DBLP DOI BibTeX RDF	Bottleneck shortest path, Maximum capacity path problem, Sensitivity analysis, Shortest path problem
2	Sudip Misra, B. John Oommen	Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem.	IEA/AIE	2004	DBLP DOI BibTeX RDF	Intelligent Systems, Learning Automata, Dynamic Shortest Paths
2	Tadao Takaoka	A Faster Algorithm for the All-Pairs Shortest Path Problem and Its Application.	COCOON	2004	DBLP DOI BibTeX RDF
2	Tatiana Starostina, Stephan Dempe	Sensitivity Analysis for Fuzzy Shortest Path Problem.	Fuzzy Days	2004	DBLP DOI BibTeX RDF
2	Diah Chaerani, Cornelis Roos, A. Aman	The Robust Shortest Path Problem by Means of Robust Linear Optimization.	OR	2004	DBLP DOI BibTeX RDF
2	Holger Bast, Kurt Mehlhorn, Guido Schäfer	A Heuristic for Dijkstra's Algorithm with Many Targets and Its Use in Weighted Matching Algorithms.	Algorithmica	2003	DBLP DOI BibTeX RDF	Single-source shortest-path problem, Weighted bipartite matching problem, Assignment problem, Dijkstra's algorithm
2	Stephan Recker	Service Curve Based Routing Subject to Deterministic QoS Constraints.	Telecommunication Systems	2003	DBLP DOI BibTeX RDF	deterministic network calculus, cost model for service curves, optimal link resource allocation, restricted shortest path problem, local search heuristics, service curves
2	Jan-Ming Ho, De-Ron Liang, Kuo-Hui Tsai	On multicast routing in Clos networks.	ISPAN	1996	DBLP DOI BibTeX RDF	online multicast routing, off-line routing, quality of service, performance evaluation, NP-complete, multiprocessor interconnection networks, video conferencing, network routing, multicast routing, high speed networks, system performance, shortest path problem, Clos networks, network throughput, Steiner tree problem, optimizing criteria
2	K. B. Lakshmanan, Krishnaiyan Thulasiraman, M. A. Comeau	An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	efficient distributed protocol, negative weights, single-source shortest-path problem, asynchronous directed network, unbounded message complexity, synchronous version, Chandy-Misra algorithm, efficient synchronizer, computational complexity, protocols, distributed algorithms, distributed processing, directed graphs, time complexities, edges, cycle, nodes, worst case, asynchronous protocol
1	Yong Deng, Yuxin Chen, Yajuan Zhang, Sankaran Mahadevan	Fuzzy Dijkstra algorithm for shortest path problem under uncertain environment.	Appl. Soft Comput.	2012	DBLP DOI BibTeX RDF
1	Yaling Dou, Lichun Zhu, Ho Simon Wang	Solving the fuzzy shortest path problem using multi-criteria decision method based on vague similarity measure.	Appl. Soft Comput.	2012	DBLP DOI BibTeX RDF
1	Asghar Aini, Amir Salehipour	Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem.	Appl. Math. Lett.	2012	DBLP DOI BibTeX RDF
1	Gergely Neu, András György, Csaba Szepesvári	The adversarial stochastic shortest path problem with unknown transition probabilities.	Journal of Machine Learning Research - Proceedings Track	2012	DBLP BibTeX RDF
1	Sebastian Elizabeth, L. Sujatha	Fuzzy Shortest Path Problem Based on Level λ-Triangular LR Fuzzy Numbers.	Adv. Fuzzy Systems	2012	DBLP DOI BibTeX RDF
1	Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang	A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths	CoRR	2012	DBLP BibTeX RDF
1	Jianqiang Cheng, Stefanie Kosuch, Abdel Lisser	Stochastic Shortest Path Problem with Uncertain Delays.	ICORES	2012	DBLP BibTeX RDF
1	F. Guerriero, L. Di Puglia Pugliese	Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows.	Optimization Methods and Software	2011	DBLP DOI BibTeX RDF
1	Yudong Zhang, Lenan Wu, Geng Wei, Shuihua Wang	A novel algorithm for all pairs shortest path problem based on matrix multiplication and pulse coupled neural network.	Digital Signal Processing	2011	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Edda Happ, Christian Klein	Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem.	Evolutionary Computation	2011	DBLP DOI BibTeX RDF
1	Bang Ye Wu	A simpler and more efficient algorithm for the next-to-shortest path problem	CoRR	2011	DBLP BibTeX RDF
1	Yuan Gao	Shortest path problem with uncertain arc lengths.	Computers & Mathematics with Applications	2011	DBLP DOI BibTeX RDF
1	Tetsuo Asano, Benjamin Doerr	Memory-Constrained Algorithms for Shortest Path Problem.	CCCG	2011	DBLP BibTeX RDF
1	Leonardo C. T. Bezerra, Elizabeth Ferreira Gouvea Goldbarg, Luciana S. Buriol, Marco César Goldbarg	GRACE: A Generational Randomized ACO for the Multi-objective Shortest Path Problem.	EMO	2011	DBLP DOI BibTeX RDF
1	Takashi Hasuike, Hideki Katagiri	Interactive decision making for a shortest path problem with interval arc lengths.	GrC	2011	DBLP DOI BibTeX RDF
1	G. Sauvanet, Emmanuel Néron	Search for the best compromise solution on Multiobjective shortest path problem.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Mohamed Cheikh, Bassem Jarboui, Taïcir Loukil	A genetic algorithms to solve the bicriteria shortest path problem.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Nora Touati Moungla, Lucas Létocart, Anass Nagih	An improving dynamic programming algorithm to solve the shortest path problem with time windows.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Stefanie Kosuch, Abdel Lisser	Stochastic Shortest Path Problem with Delay Excess Penalty.	Electronic Notes in Discrete Mathematics	2010	DBLP DOI BibTeX RDF
1	Rahim A. Abbaspour, Farhad Samadzadegan	An evolutionary solution for multimodal shortest path problem in metropolises.	Comput. Sci. Inf. Syst.	2010	DBLP DOI BibTeX RDF
1	Keivan Ghoseiri, Behnam Nadjari	An ant colony optimization algorithm for the bi-objective shortest path problem.	Appl. Soft Comput.	2010	DBLP DOI BibTeX RDF
1	Michael Drexl, Eric Prescott-Gagnon	Labelling algorithms for the elementary shortest path problem with resource constraints considering EU drivers' rules.	Logistics Research	2010	DBLP DOI BibTeX RDF
1	K. Subramani, Kamesh Madduri	Two-level heaps: a new priority queue structure with applications to the single source shortest path problem.	Computing	2010	DBLP DOI BibTeX RDF
1	Manuel Iori, Silvano Martello, Daniele Pretolani	An aggregate label setting policy for the multi-objective shortest path problem.	European Journal of Operational Research	2010	DBLP DOI BibTeX RDF
1	Christian Horoba	Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem.	Evolutionary Computation	2010	DBLP DOI BibTeX RDF
1	Dachuan Wei	An Optimized Floyd Algorithm for the Shortest Path Problem.	JNW	2010	DBLP DOI BibTeX RDF
1	Leizer Lima Pinto, Marta M. B. Pascoal	On algorithms for the tricriteria shortest path problem with two bottleneck objective functions.	Computers & OR	2010	DBLP DOI BibTeX RDF
1	Eldar Fischer, Oded Lachish, Raphael Yuster	Two-phase algorithms for the parametric shortest path problem	CoRR	2010	DBLP BibTeX RDF
1	Victor Chepoi, Daniela Maftuleac	Shortest path problem in rectangular complexes of global nonpositive curvature	CoRR	2010	DBLP BibTeX RDF
1	Ning Shi	K Constrained Shortest Path Problem.	IEEE T. Automation Science and Engineering	2010	DBLP DOI BibTeX RDF
1	James B. Orlin, Kamesh Madduri, K. Subramani, M. Williamson	A faster algorithm for the single source shortest path problem with few distinct positive lengths.	J. Discrete Algorithms	2010	DBLP DOI BibTeX RDF
1	Frank Neumann, Madeleine Theile	How Crossover Speeds Up Evolutionary Algorithms for the Multi-criteria All-Pairs-Shortest-Path Problem.	PPSN	2010	DBLP DOI BibTeX RDF
1	Benjamin Doerr, Daniel Johannsen, Timo Kötzing, Frank Neumann, Madeleine Theile	More Effective Crossover Operators for the All-Pairs Shortest Path Problem.	PPSN	2010	DBLP DOI BibTeX RDF
1	Sourav Chakraborty, Eldar Fischer, Oded Lachish, Raphael Yuster	Two-phase Algorithms for the Parametric Shortest Path Problem.	STACS	2010	DBLP DOI BibTeX RDF
1	Yafei Guo, Zheng Qin, Yang Chang	A novel hybrid algorithm for the dynamic shortest path problem.	ICNC	2010	DBLP DOI BibTeX RDF
1	Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi	An A* Algorithm Framework for the Point-to-Point Time-Dependent Shortest Path Problem.	CGGA	2010	DBLP DOI BibTeX RDF
1	Bang Ye Wu	A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem.	COCOA	2010	DBLP DOI BibTeX RDF
1	Tadao Takaoka, Mashitoh Hashim	A Simpler Algorithm for the All Pairs Shortest Path Problem with O(n2logn) Expected Time.	COCOA	2010	DBLP DOI BibTeX RDF
1	Marina Yusoff, Junaidah Ariffin, Azlinah Mohamed	A discrete particle swarm optimization with random selection solution for the shortest path problem.	SoCPaR	2010	DBLP DOI BibTeX RDF
1	Gergely Neu, András György, Csaba Szepesvári	The Online Loop-free Stochastic Shortest-Path Problem.	COLT	2010	DBLP BibTeX RDF
1	Andreas Artmeier, Julian Haselmayr, Martin Leucker, Martin Sachenbacher	The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles.	KI	2010	DBLP DOI BibTeX RDF
1	Yusuke Sakumoto, Hiroyuki Ohsaki, Makoto Imase	On the Effectiveness of Thorup's Shortest Path Algorithm for Large-Scale Network Simulation.	SAINT	2010	DBLP DOI BibTeX RDF	single-souce shortest-path problem, large-scale network simulation, thorup's algorithm, dijkstra's algorithm
1	Benjamin Doerr, Daniel Johannsen	Edge-based representation beats vertex-based representation in shortest path problems.	GECCO	2010	DBLP DOI BibTeX RDF	evolutionary algorithm, shortest path, runtime analysis
1	Ranga Muhandiramge, Natashia Boland	Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem.	Networks	2009	DBLP DOI BibTeX RDF
1	Qing Chang, Yongqiang Liu, Huagang Xiong	An Improved Ant Colony Algorithm for the Shortest Path Problem in Time-Dependent Networks.	IEICE Transactions	2009	DBLP BibTeX RDF
1	Leizer de Lima Pinto, Claudio T. Bornstein, Nelson Maculan	The tricriterion shortest path problem with at least two bottleneck objective functions.	European Journal of Operational Research	2009	DBLP DOI BibTeX RDF
1	Kevin R. Hutson, Douglas R. Shier	Extended dominance and a stochastic shortest path problem.	Computers & OR	2009	DBLP DOI BibTeX RDF
1	Julian John McAuley, Tibério S. Caetano	An expected-case sub-cubic solution to the all-pairs shortest path problem in R	CoRR	2009	DBLP BibTeX RDF
1	XiaoBin Wang, Hong Qu, Zhang Yi	A modified pulse coupled neural network for shortest-path problem.	Neurocomputing	2009	DBLP DOI BibTeX RDF
1	Christina Büsing	The Exact Subgraph Recoverable Robust Shortest Path Problem.	Robust and Online Large-Scale Optimization	2009	DBLP DOI BibTeX RDF
1	Hui Cheng, Shengxiang Yang	Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks.	IEEE Congress on Evolutionary Computation	2009	DBLP DOI BibTeX RDF
1	Christian Horoba	Analysis of a simple evolutionary algorithm for the multiobjective shortest path problem.	FOGA	2009	DBLP DOI BibTeX RDF
1	K. Subramani, Kamesh Madduri	Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem.	COCOA	2009	DBLP DOI BibTeX RDF
1	Mirko Maischberger	Optimising Node Coordinates for the Shortest Path Problem.	CTW	2009	DBLP BibTeX RDF
1	Huy Nguyen Anh Pham, Arthur M. D. Shr, Peter P. Chen	Dedicated Machine Constraint Scheduling as a Shortest-Path Problem.	ICTAI	2009	DBLP DOI BibTeX RDF
1	Yan Guo, Sanyou Y. Zeng, Lishan Kang, Gang Liu, Nannan Hu, Kuo Zhao	A Route System Based on Genetic Algorithm for Coarse-Grain Reconfigurable Architecture.	ISICA	2009	DBLP DOI BibTeX RDF	resources-constrained multi-pair shortest path problem in directed graphs, Multi-pair path encoding, Genetic algorithm, Coarse-grain reconfigurable architecture
1	Paola Festa	Shortest Path Tree Algorithms.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Auction technique, Combinatorial optimization, Network optimization, Shortest path problem
1	Siriphong Lawphongpanich	Simplicial Decomposition.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Carathéodory theorem, first order Taylor series expansion, Frank-Wolfe algorithm, Inner linearization, Master problem, Node-arc incidence matrix, Nonlinear dynamic network flow problem, Nonlinear multicommodity flow problems, Nonlinear single commodity network flow problem, Polyhedral set, Positive definite matrix, Pseudoconvexity, P-simplex, regularized Frank-Wolfe algorithm, Regularized subproblem, Restricted simplicial decomposition, Simplicial decomposition, Subproblem, Superlinear convergent rate, Traffic assignment problem, Side constraints, Linear program, Rank, Globally optimal, Convex hull, Nonlinear programming, Nonlinear program, Dimension, Column generation, Shortest path problem, Polyhedron, Restriction, Simplex algorithm, Extreme point, Dantzig-Wolfe decomposition, Convex combinations
1	Shu Yan Chan, Ian X. Y. Leung, Pietro Liò	Fast centrality approximation in modular networks.	CIKM-CNIKM	2009	DBLP DOI BibTeX RDF	modularity, complex network, centrality, community detection
1	Benjamin Doerr, Madeleine Theile	Improved analysis methods for crossover-based algorithms.	GECCO	2009	DBLP DOI BibTeX RDF	evolutionary algorithm, combinatorial optimization, crossover
1	Pankaj K. Agarwal, R. Sharathkumar, Hai Yu	Approximate Euclidean shortest paths amid convex obstacles.	SODA	2009	DBLP DOI BibTeX RDF
1	Aaron Bernstein, David R. Karger	A nearly optimal oracle for avoiding failed vertices and edges.	STOC	2009	DBLP DOI BibTeX RDF	shortest paths, sensitivity
1	Shi-Qing Xin, Guo-Jin Wang	Improving Chen and Han's algorithm on the discrete geodesic problem.	ACM Trans. Graph.	2009	DBLP DOI BibTeX RDF	computational geometry, shortest path problems, Design and analysis of algorithms
1	Yifeng Huang, Kamal Gupta	Collision-probability constrained PRM for a manipulator with base pose uncertainty.	IROS	2009	DBLP DOI BibTeX RDF
1	Tingting Han, Joost-Pieter Katoen, Berteun Damman	Counterexample Generation in Probabilistic Model Checking.	IEEE Trans. Software Eng.	2009	DBLP DOI BibTeX RDF
1	J. Coego, Lawrence Mandow, José-Luis Pérez-de-la-Cruz	A New Approach to Iterative Deepening Multiobjective A.	AI*IA	2009	DBLP DOI BibTeX RDF
1	Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan	A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem.	CPAIOR	2009	DBLP DOI BibTeX RDF
1	Daniel Delling, Thomas Pajor, Dorothea Wagner	Accelerating Multi-modal Route Planning by Access-Nodes.	ESA	2009	DBLP DOI BibTeX RDF
1	Franz-Josef Brandenburg, Mao-cheng Cai	Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains.	FAW	2009	DBLP DOI BibTeX RDF	extended networks, lossy and gainy arcs, max-flow, unit-loss networks, shortest path, NP-hard