A note on two problems in connexion with graphs

Cites Work

On the shortest spanning subtree of a graph and the traveling salesman problem
Maximal Flow Through a Network

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

Compact formulations of the Steiner traveling salesman problem and related problems
Netscan: a procedure for generating reaction networks by size
Fast methods for the Eikonal and related Hamilton– Jacobi equations on unstructured meshes
Efficient computation of Lyapunov functions for Morse decompositions
Fast algorithms for the undirected negative cost cycle detection problem
A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines
Large-scale optimization with the primal-dual column generation method
OAR lib: an open source arc routing library
Ordered line integral methods for solving the eikonal equation
The geometry of nonparametric filament estimation
A set oriented approach to global optimal control
Trip-based path algorithms using the transit network hierarchy
Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems
Some graft transformations and its applications on the distance spectral radius of a graph
Approximately matching context-free languages
A survey of graph edit distance
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
Optimal routing for maximizing the travel time reliability
Dimensionality reduction of collective motion by principal manifolds
Geodesic distance and curves through isotropic and anisotropic heat equations on images and surfaces
Solving shortest paths efficiently on nearly acyclic directed graphs
The traveling-salesman problem and minimum spanning trees: Part II
3D shape retrieval using kernels on extended Reeb graphs
A history of graph entropy measures
ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
Scaling algorithms for network problems
Scheduling jobs with fixed start and end times
Value-at-Risk model for hazardous material transportation
The ellipsoid method and its consequences in combinatorial optimization
Distributed shortest-path protocols for time-dependent networks
\(L_ 1\) shortest paths among polygonal obstacles in the plane
Weighted \(A^*\) search - unifying view and application
Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
Routing of a hazmat truck in the presence of weather systems
Approximate analysis of \(M/G/c/c\) state-dependent queueing networks
Locational optimization problems solved through Voronoi diagrams
Shortest path algorithms for nearly acyclic directed graphs
Information processing in complex networks: Graph entropy and information functionals
Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
On the system optimum of traffic assignment in \(M/G/c/c\) state-dependent queueing networks
Finding the most vital node of a shortest path.
On the robust shortest path problem.
Algorithms for finding k-best perfect matchings
ASKNET: CREATING AND EVALUATING LARGE SCALE INTEGRATED SEMANTIC NETWORKS
Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
Heuristic and exact algorithms for the simultaneous assignment problem
New scaling algorithms for the assignment and minimum mean cycle problems
Time-dependent SHARC-routing
Structural information content of networks: graph entropy based on local vertex functionals
A shortest-path algorithm for Manhattan graphs
Fast image inpainting based on coherence transport
Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
A bicriterion shortest path algorithm
Potential-based bounded-cost search and anytime non-parametric A*
Routing of uncertain traffic demands
The shortest-path problem for graphs with random arc-lengths
The inventory-routing problem with transshipment
Vehicle routing under time-dependent travel times: the impact of congestion avoidance
Service and capacity allocation in \(M/G/c/c\) state-dependent queueing networks
On the use of ordered sets in problems of comparison and consensus of classifications
A branch and bound algorithm for the robust shortest path problem with interval data.
Distance spectra of graphs: a survey
Linear-time approximation for maximum weight matching
A new approach to all-pairs shortest paths on real-weighted graphs
Nurse scheduling with tabu search and strategic oscillation
On the \(K\) shortest path trees problem
Class Steiner trees and VLSI-design
A capacitated network flow optimization approach for short notice evacuation planning
Primal convergence from dual subgradient methods for convex optimization
Planning and navigation as active inference
Anytime search in dynamic graphs
Polygonal finite elements for topology optimization: a unifying paradigm
Effective algorithms for a class of discrete valued optimal control problems
Some concepts of stability analysis in combinatorial optimization
A set oriented approach to optimal feedback stabilization
Deviation algorithms for ranking shortest paths
An exact algorithm for the robust shortest path problem with interval data
A toolbox for simulation of hybrid systems in Matlab/Simulink. Hybrid Equations (HyEQ) Toolbox
Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?
Shortest-path queries in static networks
A combination of flow shop scheduling and the shortest path problem
Improvement of path analysis algorithm in social networks based on HBase
A survey of recent developments in multiobjective optimization
An algorithm for ranking assignments using reoptimization
Swarm intelligence for self-organized clustering
Rectilinear paths among rectilinear obstacles
roads
Connectivity and minimal distance spectral radius of graphs
Using projection-based clustering to find distance- and density-based clusters in high-dimensional data
cppRouting
Shortest paths in time-dependent FIFO networks
\(K\)-tree/\(K\)-subgraph: A program package for minimal weighted \(K\)-cardinlity trees and subgraphs
Hedging uncertainty: approximation algorithms for stochastic optimization problems
locationgamer
Bidirectional \(A^*\) search on time-dependent road networks
Fixpoints and search in PVS
A shortest augmenting path algorithm for dense and sparse linear assignment problems
Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
Zélus: a synchronous language with ODEs
Disjoint paths in a network

This page was built for publication: A note on two problems in connexion with graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q78129)