Search results for "shortest path problems"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Christian Horoba, Dirk Sudholt	Ant colony optimization for stochastic shortest path problems.	GECCO	2010	DBLP DOI BibTeX RDF	combinatorial optimization, ant colony optimization, stochastic optimization, shortest path problems, running time analysis
2	Christian Horoba, Dirk Sudholt	Running Time Analysis of ACO Systems for Shortest Path Problems.	SLS	2009	DBLP DOI BibTeX RDF
2	John Hershberger, Subhash Suri, Amit M. Bhosle	On the difficulty of some shortest path problems.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	k shortest simple paths, replacement path, lower bound, shortest path
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	Daniel Golovin, Vineet Goyal, R. Ravi	Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.	STACS	2006	DBLP DOI BibTeX RDF
2	John Hershberger, Subhash Suri, Amit M. Bhosle	On the Difficulty of Some Shortest Path Problems.	STACS	2003	DBLP DOI BibTeX RDF
2	Arunabha Sen, K. Selçuk Candan, Afonso Ferreira, Bruno Beauquier, Stephane Perennes	On Shortest Path Problems with "Non-Markovian" Link Contribution to Path Lengths.	NETWORKING	2000	DBLP DOI BibTeX RDF
2	Michael T. Goodrich, Steven B. Shauck, Sumanta Guha	Parallel Methods for Visibility and Shortest Path Problems in Simple Polygons (Preliminary Version).	Symposium on Computational Geometry	1990	DBLP DOI BibTeX RDF
1	Linzhong Liu, Haibo Mu, Xinfeng Yang, Ruichun He, Yinzhen Li	An oriented spanning tree based genetic algorithm for multi-criteria shortest path problems.	Appl. Soft Comput.	2012	DBLP DOI BibTeX RDF
1	Christina Büsing	Recoverable robust shortest path problems.	Networks	2012	DBLP DOI BibTeX RDF
1	Enrique Machuca, Lawrence Mandow, José-Luis Pérez-de-la-Cruz, Amparo Ruiz-Sepúlveda	A comparison of heuristic best-first algorithms for bicriterion shortest path problems.	European Journal of Operational Research	2012	DBLP DOI BibTeX RDF
1	Alexander Paprotny, Jochen Garcke	On a Connection between Maximum Variance Unfolding, Shortest Path Problems and IsoMap.	Journal of Machine Learning Research - Proceedings Track	2012	DBLP BibTeX RDF
1	Olivia J. Smith, Natashia Boland, Hamish Waterer	Solving shortest path problems with a weight constraint and replenishment arcs.	Computers & OR	2012	DBLP DOI BibTeX RDF
1	Eric A. Hansen	Suboptimality Bounds for Stochastic Shortest Path Problems	CoRR	2012	DBLP BibTeX RDF
1	Dirk Sudholt, Christian Thyssen	Running time analysis of Ant Colony Optimization for shortest path problems.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
1	Lara Turner	Variants of Shortest Path Problems.	Algorithmic Operations Research	2011	DBLP BibTeX RDF
1	Line Blander Reinhardt, David Pisinger	Multi-objective and multi-constrained non-additive shortest path problems.	Computers & OR	2011	DBLP DOI BibTeX RDF
1	Daniele Catanzaro, Martine Labbé, Martha Salazar-Neumann	Reduction approaches for robust shortest path problems.	Computers & OR	2011	DBLP DOI BibTeX RDF
1	Atlas F. Cook, Carola Wenk	Link distance and shortest path problems in the plane.	Comput. Geom.	2011	DBLP DOI BibTeX RDF
1	Oktay Arslan, Panagiotis Tsiotras, Xiaoming Huo	Solving shortest path problems with curvature constraints using beamlets.	IROS	2011	DBLP DOI BibTeX RDF
1	Eric A. Hansen	Suboptimality Bounds for Stochastic Shortest Path Problems.	UAI	2011	DBLP BibTeX RDF
1	S. Mehdi Hashemi, Shaghayegh Mokarami, Ebrahim Nasrabadi	Dynamic shortest path problems with time-varying costs.	Optimization Letters	2010	DBLP DOI BibTeX RDF	Time-varying networks, Labeling algorithms, Dynamic shortest paths
1	Charles B. Ward, Nathan M. Wiegand	Complexity results on labeled shortest path problems from wireless routing metrics.	Computer Networks	2010	DBLP DOI BibTeX RDF
1	Shi-Qing Xin, Guo-Jin Wang	Applying the improved Chen and Han's algorithm to different versions of shortest path problems on a polyhedral surface.	Computer-Aided Design	2010	DBLP DOI BibTeX RDF
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	David Starobinski, Weiyao Xiao	Asymptotically Optimal Data Dissemination in Multichannel Wireless Sensor Networks: Single Radios Suffice.	IEEE/ACM Trans. Netw.	2010	DBLP DOI BibTeX RDF
1	Nikolaos E. Pratikakis, Matthew J. Realff, Jay H. Lee	Controlled exploration of state space in off-line ADP and its application to stochastic shortest path problems.	Computers & Chemical Engineering	2009	DBLP DOI BibTeX RDF
1	Andrea Raith, Matthias Ehrgott	A comparison of solution strategies for biobjective shortest path problems.	Computers & OR	2009	DBLP DOI BibTeX RDF
1	Marco Saerens, Youssef Achbany, François Fouss, Luh Yen	Randomized Shortest-Path Problems: Two Related Models.	Neural Computation	2009	DBLP DOI BibTeX RDF
1	Ioannis P. Androulakis	Dynamic Programming: Stochastic Shortest Path Problems.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	Stochastic shortest path, Dynamic programming, Infinite horizon problems
1	Atlas F. Cook, Carola Wenk	Link Distance and Shortest Path Problems in the Plane.	AAIM	2009	DBLP DOI BibTeX RDF	Fréchet Distance, Link Distance, Voronoi Diagram, Shortest Path Map
1	Atlas F. Cook, Carola Wenk	Shortest Path Problems on a Polyhedral Surface.	WADS	2009	DBLP DOI BibTeX RDF	Fréchet distance, Voronoi Diagram, Diameter, Polyhedral Surface, Shortest Path Map
1	Lawrence Mandow, José-Luis Pérez-de-la-Cruz	A Memory-Efficient Search Strategy for Multiobjective Shortest Path Problems.	KI	2009	DBLP DOI BibTeX RDF
1	Changyin Zhou	An Approximation Based Approach for Dynamic Stochastic Shortest Path Problems.	WGEC	2009	DBLP DOI BibTeX RDF
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	Christophe Crespelle, Philippe Gambette	Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search.	IWOCA	2009	DBLP DOI BibTeX RDF
1	W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood	Lagrangian relaxation and enumeration for solving constrained shortest-path problems.	Networks	2008	DBLP DOI BibTeX RDF
1	Alexander Vladimirsky	Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs.	Math. Oper. Res.	2008	DBLP DOI BibTeX RDF
1	Yoshio Ohtsubo	Stochastic shortest path problems with associative accumulative criteria.	Applied Mathematics and Computation	2008	DBLP DOI BibTeX RDF
1	Lawrence Mandow, José-Luis Pérez-de-la-Cruz	Frontier Search for Bicriterion Shortest Path Problems.	ECAI	2008	DBLP DOI BibTeX RDF
1	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
1	Ran Duan, Seth Pettie	Bounded-leg distance and reachability oracles.	SODA	2008	DBLP DOI BibTeX RDF
1	Penny E. Haxell, Gordon T. Wilfong	A fractional model of the border gateway protocol (BGP).	SODA	2008	DBLP DOI BibTeX RDF
1	Charles B. Ward, Nathan M. Wiegand, Phillip G. Bradford	A Distributed Context-Free Language Constrained Shortest Path Algorithm.	ICPP	2008	DBLP DOI BibTeX RDF
1	Zbigniew Tarapata	Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms.	Applied Mathematics and Computer Science	2007	DBLP DOI BibTeX RDF
1	Blai Bonet	On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems.	Math. Oper. Res.	2007	DBLP DOI BibTeX RDF
1	Stephen D. Patek	Partially Observed Stochastic Shortest Path Problems With Approximate Solution by Neurodynamic Programming.	IEEE Transactions on Systems, Man, and Cybernetics, Part A	2007	DBLP DOI BibTeX RDF
1	M. Zamirian, M. H. Farahi, A. R. Nazemi	An applicable method for solving the shortest path problems.	Applied Mathematics and Computation	2007	DBLP DOI BibTeX RDF
1	Fajie Li, Reinhard Klette	Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems.	ICCTA	2007	DBLP DOI BibTeX RDF
1	Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis	Efficient models for timetable information in public transportation systems.	ACM Journal of Experimental Algorithmics	2007	DBLP DOI BibTeX RDF	itinerary query, public transportation system, timetable information, Shortest path
1	Tian Liang, Jigui Sun, Minghao Yin	Improving the Convergence of RTDP.	FSKD	2007	DBLP DOI BibTeX RDF
1	Vijaya Ramachandran	Cache-Oblivious Computation: Algorithms and Experimental Evaluation.	ICCTA	2007	DBLP DOI BibTeX RDF
1	Gaurav Trivedi, Sumit Punglia, H. Narayanan	Application of DC Analyzer to Combinatorial Optimization Problems.	VLSI Design	2007	DBLP DOI BibTeX RDF
1	K. Subramani, Kamesh Madduri	Accomplishing Approximate FCFS Fairness Without Queues.	HiPC	2007	DBLP DOI BibTeX RDF
1	Felix Hahne, Curt Nowak, Klaus Ambrosi	Acceleration of the A*-Algorithm for the Shortest Path Problem in Digital Road Maps.	OR	2007	DBLP DOI BibTeX RDF
1	Meinolf Sellmann, Thorsten Gellermann, Robert Wright	Cost-based Filtering for Shorter Path Constraints.	Constraints	2007	DBLP DOI BibTeX RDF	Global constraints, Optimization constraints, Relaxed consistency, Constrained shortest paths, Problem reduction
1	Till Tantau	Logspace Optimization Problems and Their Approximability Properties.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Horst W. Hamacher, Stefan Ruzika, Stevanus A. Tjandra	Algorithms for time-dependent bicriteria shortest path problems.	Discrete Optimization	2006	DBLP DOI BibTeX RDF
1	Hamid Beigy, Mohammad Reza Meybodi	Utilizing Distributed Learning Automata to Solve Stochastic Shortest Path Problems.	International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems	2006	DBLP DOI BibTeX RDF
1	Matthias Müller-Hannemann, Karsten Weihe	On the cardinality of the Pareto set in bicriteria shortest path problems.	Annals OR	2006	DBLP DOI BibTeX RDF	Pareto search, Railway networks, Shortest paths, Multi-criteria optimization
1	Ovidiu Daescu, James D. Palmer	Finding optimal weighted bridges with applications.	ACM Southeast Regional Conference	2006	DBLP DOI BibTeX RDF	optimal bridges, weighted regions, path planning
1	Camil Demetrescu, Giuseppe F. Italiano	Experimental analysis of dynamic all pairs shortest path algorithms.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	shortest paths, Dynamic graph algorithms, experimental algorithmics
1	Dan C. Stefanescu, Alex Thomo	Enhanced Regular Path Queries on Semistructured Databases.	EDBT Workshops	2006	DBLP DOI BibTeX RDF
1	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
1	Shulin Cui, Jigui Sun, Minghao Yin, Shuai Lu	Solving Uncertain Markov Decision Problems: An Interval-Based Method.	ICNC	2006	DBLP DOI BibTeX RDF
1	Danny Z. Chen, Chao Wang	Field Splitting Problems in Intensity-Modulated Radiation Therapy.	ISAAC	2006	DBLP DOI BibTeX RDF
1	Felix König	Traffic Optimization Under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods.	OR	2006	DBLP DOI BibTeX RDF
1	Seongmoon Kim, Mark E. Lewis, Chelsea C. White III	State space reduction for nonstationary stochastic shortest path problems with real-time traffic information.	IEEE Transactions on Intelligent Transportation Systems	2005	DBLP DOI BibTeX RDF
1	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
1	V. N. Sastry, T. N. Janakiraman, S. Ismail Mohideen	New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems.	Int. J. Comput. Math.	2005	DBLP DOI BibTeX RDF
1	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	Determining approximate shortest paths on weighted polyhedral surfaces.	J. ACM	2005	DBLP DOI BibTeX RDF	weighted paths, approximation algorithms, computational geometry, shortest path problems, Design and analysis of algorithms, polyhedral surfaces
1	Olivier Buffet	Reachability Analysis for Uncertain SSPs.	ICTAI	2005	DBLP DOI BibTeX RDF
1	Yuusuke Kounoike, Keiichi Kaneko, Yuji Shinano	Computing the Diameters of 14- and 15-Pancake Graphs.	ISPAN	2005	DBLP DOI BibTeX RDF
1	Yong Chen, Qingyu Yang	Reliability of two-stage weighted-k-out-of-n systems with components in common.	IEEE Transactions on Reliability	2005	DBLP DOI BibTeX RDF
1	Takeshi Shirabe	Shortest Path Search from a Physical Perspective.	COSIT	2005	DBLP DOI BibTeX RDF
1	Samir Khuller, Kwangil Lee, Mark A. Shayman	On Degree Constrained Shortest Paths.	ESA	2005	DBLP DOI BibTeX RDF
1	Till Tantau	Logspace Optimization Problems and Their Approximability Properties.	FCT	2005	DBLP DOI BibTeX RDF
1	Manolis Terrovitis, Spiridon Bakiras, Dimitris Papadias, Kyriakos Mouratidis	Constrained Shortest Path Computation.	SSTD	2005	DBLP DOI BibTeX RDF
1	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
1	Pasquale Avella, Maurizio Boccia, Antonio Sforza	Resource Constrained Shortest Path Problems in Path Planning for Fleet Management.	J. Math. Model. Algorithms	2004	DBLP DOI BibTeX RDF
1	Junying Zhang, Defeng Wang, Meihong Shi, Yue Joseph Wang	Output-threshold coupled neural network for solving the shortest path problems.	Science in China Series F: Information Sciences	2004	DBLP DOI BibTeX RDF
1	Shinkoh Okada	Fuzzy shortest path problems incorporating interactivity among paths.	Fuzzy Sets and Systems	2004	DBLP DOI BibTeX RDF
1	J. A. Bakker, J. H. ter Bekke	A Query Language Solution for Shortest Path Problems in Cyclic Geometrics.	Databases and Applications	2004	DBLP BibTeX RDF
1	Alexandre X. Falcão, Jorge Stolfi, Roberto de Alencar Lotufo	The Image Foresting Transform: Theory, Algorithms, and Applications.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	regional minima, boundary tracking, distance transforms and multiscale skeletonization, image segmentation, image analysis, shortest-path problems, Dijkstra's algorithm, watershed transform, morphological reconstruction
1	Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. Italiano	Experimental analysis of dynamic all pairs shortest path algorithms.	SODA	2004	DBLP DOI BibTeX RDF
1	Rezaul Alam Chowdhury, Vijaya Ramachandran	Cache-oblivious shortest paths in graphs using buffer heap.	SPAA	2004	DBLP DOI BibTeX RDF	buffer heap, cache-aware model, cache-oblivious model, decrease-key, tournament tree, shortest paths, priority queue
1	Daniel Bienstock, Garud Iyengar	Solving fractional packing problems in Oast(1/?) iterations.	STOC	2004	DBLP DOI BibTeX RDF
1	Matthias Müller-Hannemann, Mathias Schnee	Finding All Attractive Train Connections by Multi-criteria Pareto Search.	ATMOS	2004	DBLP DOI BibTeX RDF
1	Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, Christos D. Zaroliagis	Timetable Information: Models and Algorithms.	ATMOS	2004	DBLP DOI BibTeX RDF
1	Jakob Krarup, Malene Nordlund Rørbech	LP formulations of the shortest path tree problem.	4OR	2004	DBLP DOI BibTeX RDF	visualizing LP-duality, linear programming, Shortest paths
1	Hanif D. Sherali, Antoine G. Hobeika, Sasikul Kangwalklai	Time-Dependent, Label-Constrained Shortest Path Problems with Applications.	Transportation Science	2003	DBLP DOI BibTeX RDF
1	Meinolf Sellmann	Cost-Based Filtering for Shorter Path Constraints.	CP	2003	DBLP DOI BibTeX RDF	optimization constraints, relaxed consistency, constrained shortest paths, problem reduction
1	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	An Improved Approximation Algorithm for Computing Geometric Shortest Paths.	FCT	2003	DBLP DOI BibTeX RDF
1	Stefano Bistarelli, Ugo Montanari, Francesca Rossi	Soft Constraint Logic Programming and Generalized Shortest Path Problems.	J. Heuristics	2002	DBLP DOI BibTeX RDF
1	Christopher L. Barrett, Keith R. Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe	Classical and Contemporary Shortest Path Problems in Road Networks: Implementation and Experimental Analysis of the TRANSIMS Router.	ESA	2002	DBLP DOI BibTeX RDF
1	Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park	Fast Algorithms with Algebraic Monge Properties.	MFCS	2002	DBLP DOI BibTeX RDF
1	Masahito Yamamoto, Nobuo Matsuura, Toshikazu Shiba, Yumi Kawazoe, Azuma Ohuchi	Solutions of Shortest Path Problems by Concentration Control.	DNA	2001	DBLP DOI BibTeX RDF
1	Feodor F. Dragan	Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach.	WG	2001	DBLP DOI BibTeX RDF
1	Luis C. Dias, João C. N. Clímaco	Shortest path problems with partial information: Models and algorithms for detecting dominance.	European Journal of Operational Research	2000	DBLP DOI BibTeX RDF
1	Anders J. V. Skriver, Kim Allan Andersen	A label correcting approach for solving bicriterion shortest-path problems.	Computers & OR	2000	DBLP DOI BibTeX RDF