The following pages link to On a routing problem (Q3249327):
Displayed 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems (Q262437) (← links)
- Finding reliable shortest paths in road networks under uncertainty (Q264260) (← links)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- Lower bounds for monotone counting circuits (Q313809) (← links)
- An adaptive multi-spline refinement algorithm in simulation based sailboat trajectory optimization using onboard multi-core computer systems (Q326224) (← links)
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
- Road network emergency accessibility planning after a major earthquake (Q339942) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← links)
- The capacity expansion path problem in networks (Q364264) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881) (← links)
- A hybrid differential evolution and tree search algorithm for the job shop scheduling problem (Q410367) (← links)
- An efficient label setting/correcting shortest path algorithm (Q434184) (← links)
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem (Q486397) (← links)
- A reduction approach to the two-campus transport problem (Q490382) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Sequence alignment with arbitrary steps and further generalizations, with applications to alignments in linguistics (Q497193) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- The problem of maximum flow with minimum attainable cost in a network (Q505156) (← links)
- A new algorithm to compute Pareto-optimal paths in a multi objective fuzzy weighted network (Q505166) (← links)
- Scheduling for single agile satellite, redundant targets problem using complex networks theory (Q509214) (← links)
- Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks (Q513121) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- A language for generic programming in the large (Q532409) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- Optimal placement of UV-based communications relay nodes (Q604957) (← links)
- Programming with C++ concepts (Q608245) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem (Q656681) (← links)
- Shortest path problem with uncertain arc lengths (Q660922) (← links)
- A knowledge-based analysis of global function computation (Q660991) (← links)
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
- Approximately matching context-free languages (Q673469) (← links)
- Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks (Q699346) (← links)
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms (Q709151) (← links)
- Group shops scheduling with makespan criterion subject to random release dates and processing times (Q733535) (← links)
- Characterization of facets of the hop constrained chain polytope via dynamic programming (Q741741) (← links)
- High-performance simulation-based algorithms for an alpine ski racer's trajectory optimization in heterogeneous computer systems (Q747401) (← links)
- Concurrent optimization of harvesting and road network layouts under steep terrain (Q748552) (← links)
- Uncertain random shortest path problem (Q781302) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- Shortest paths in networks with vector weights (Q795755) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- Locating stops along bus or railway lines -- a bicriteria problem (Q816419) (← links)