The following pages link to Algorithm 97 (Q41444):
Displaying 50 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- Approximate matching between a context-free grammar and a finite-state automaton (Q259082) (← 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)
- On the optimality of Bellman-Ford-Moore shortest path algorithm (Q266282) (← links)
- Tropical algebra based framework for error propagation analysis in systolic arrays (Q275789) (← links)
- A flow-based tabu search algorithm for the RCPSP with transfer times (Q280159) (← links)
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs (Q294620) (← links)
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Inverse problems of demand analysis and their applications to computation of positively-homogeneous Konüs-Divisia indices and forecasting (Q318172) (← links)
- A multi-criteria police districting problem for the efficient and effective design of patrol sector (Q319842) (← links)
- The constrained shortest path problem with stochastic correlated link travel times (Q323479) (← links)
- Group-based collective keyword querying in road networks (Q344558) (← links)
- Directed Steiner trees with diffusion costs (Q346492) (← links)
- A practical greedy approximation for the directed Steiner tree problem (Q346528) (← links)
- Analysis of average shortest-path length of scale-free network (Q364556) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Crossover can provably be useful in evolutionary computation (Q418021) (← links)
- A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
- Reachability analysis for timed automata using max-plus algebra (Q444476) (← links)
- Design method using hybrid of line-type and circular-type routes for transit network system optimization (Q456929) (← links)
- An all-pairs shortest path algorithm for bipartite graphs (Q469055) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Computing periodic request functions to speed-up the analysis of non-cyclic task models (Q495917) (← links)
- Processing time-dependent shortest path queries without pre-computed speed information on road networks (Q497898) (← links)
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
- Computing maximal weak and other bisimulations (Q510897) (← links)
- Pareto optimal solutions providing optimal routes between every two different nodes in the cost-time trade-off routing network without the objectives being prioritized (Q522430) (← links)
- On distribution function of the diameter in uncertain graph (Q527187) (← links)
- Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
- Distributed and sequential algorithms for bioinformatics (Q530299) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- Computing a fuzzy shortest path in a network with mixed fuzzy arc lengths using \(\alpha \)-cuts (Q611404) (← links)
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (Q613114) (← links)
- A new monotonic, clone-independent, reversal symmetric, and condorcet-consistent single-winner election method (Q622582) (← links)
- Finding the shortest paths by node combination (Q632873) (← links)
- The equivalence of two ways of computing distances from dissimilarities for arbitrary sets of stimuli (Q654397) (← links)
- Bounded budget betweenness centrality game for strategic network formations (Q655424) (← links)
- Shortest path problem with uncertain arc lengths (Q660922) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- An efficient algorithm for finding ideal schedules (Q766186) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs (Q779456) (← links)
- Uncertain random shortest path problem (Q781302) (← links)
- Sorting can exponentially speed up pure dynamic programming (Q783692) (← links)
- A priority queue for the all pairs shortest path problem (Q794155) (← links)
