Algorithm 97

swMATH29730MaRDI QIDQ41444FDOQ41444

Author name not available (Why is that?)

Official website: https://dl.acm.org/citation.cfm?doid=367766.368168

Cited In (only showing first 100 items - show all)

• A cutting plane method for solving harvest scheduling models with area restrictions
• Semiparametric regression during 2003--2007
• Approximate matching between a context-free grammar and a finite-state automaton
• Fast algorithms for the undirected negative cost cycle detection problem
• \texttt{VeriSIMPL 2}: an open-source software for the verification of max-plus-linear systems
• On the optimality of Bellman-Ford-Moore shortest path algorithm
• OAR lib: an open source arc routing library
• Lower bounds for tropical circuits and dynamic programs
• Tropical algebra based framework for error propagation analysis in systolic arrays
• A flow-based tabu search algorithm for the RCPSP with transfer times
• Generating all vertices of a polyhedron is hard
• Consistency in networks of relations
• Shortest path algorithms for nearly acyclic directed graphs
• Algorithms for finding k-best perfect matchings
• Locating service facilities whose reliability is distance dependent.
• Solving the all-pairs-shortest-length problem on chordal bipartite graphs
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• Minimum-latency aggregation scheduling in wireless sensor network
• Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
• Shortest path problem with uncertain arc lengths
• Solving the shortest-paths problem on bipartite permutation graphs efficiently
• The shortest-path problem for graphs with random arc-lengths
• Minmax regret location--allocation problem on a network under uncertainty
• A modified evidential methodology of identifying influential nodes in weighted networks
• Network structure of two-dimensional decaying isotropic turbulence
• GrGen
• Blossom V
• Maxplus
• MENU-OKF
• MOD-DIST
• SITATION
• Computational techniques for reachability analysis of Max-Plus-Linear systems
• Prometheus
• lmeSplines
• MetaCyc
• Pmapper
• TituRel
• NETGEN
• MD-jeep
• Henshin
• AdaptFit
• FaPAS
• Graphs
• IbexOpt
• TRAVOS
• GotoBLAS
• pMatlab
• opaal
• PARAMIC
• TensorToolbox
• cnoise
• TALE
• RTC toolbox
• Portfolio Safeguard
• VeriSIMPL
• TwitterRank
• MatlabBGL
• Upper and lower bounds for the single source capacitated location problem.
• Shortest-path queries in static networks
• GString
• CEoptim
• CYANA
• GRECS
• SimRank
• Stamina
• snarkhunter
• ACME
• MotifClick
• ParaMEME
• SensorDCSP
• fast-ppr
• ArcRoutingLibrary
• RutasOptiRed
• Relation Algebra
• Theta*
• openCypher
• Trove
• PSG
• heapsort
• An integer programming approach for finding the most and the least central cliques
• Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
• Networks of constraints: Fundamental properties and applications to picture processing
• dtControl
• KATARA
• MATLANG
• Vivaldi
• SLRIC
• An algorithm for drawing general undirected graphs
• Detecting causal relationships in distributed computations: In search of the holy grail
• A note on solving large p-median problems
• A fuzzy set-based approach to origin-destination matrix estimation in urban traffic networks with imprecise data
• Modeling Dynamic Vehicle Navigation in a Self-Organizing, Peer-to-Peer, Distributed Traffic Information System
• A mean-variance model for the minimum cost flow problem with stochastic arc costs
• Routing with nonlinear multiattribute cost functions
• An efficient link allocation algorithm for survivable ATM-based personal communication networks
• Uniform embeddings for Robinson similarity matrices
• I/O-efficient algorithms for graphs of bounded treewidth
• Parallel nested dissection for path algebra computations
• Efficient transitive closure of sparse matrices over closed semirings
• A fast backtrack algorithm for graph isomorphism

This page was built for software: Algorithm 97