Pages that link to "Item:Q78129"

The following pages link to A note on two problems in connexion with graphs (Q78129):

Displaying 50 items.

• Targeted and contextual redescription set exploration (Q1631833) (← links)
• Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• Two-dimensional path finding subject to geometric constraints (Q1647427) (← links)
• A bilevel exposure-oriented sensor location problem for border security (Q1651642) (← links)
• A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
• Analysis of FPTASes for the multi-objective shortest path problem (Q1652052) (← links)
• Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks (Q1652107) (← links)
• Integrated approach to network design and frequency setting problem in railway rapid transit systems (Q1652202) (← links)
• A Benders decomposition based framework for solving cable trench problems (Q1652230) (← links)
• A decomposition based hybrid heuristic algorithm for the joint passenger and freight train scheduling problem (Q1652413) (← links)
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
• An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem (Q1664248) (← links)
• A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs (Q1665401) (← links)
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle (Q1677446) (← links)
• The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
• Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism (Q1679889) (← links)
• On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
• A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
• Location-coverage models for preventing attacks on interurban transportation networks (Q1686522) (← links)
• Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
• Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm (Q1699613) (← links)
• Instrumental variable estimation with a stochastic monotonicity assumption (Q1704705) (← links)
• Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
• Identifying influence areas with connectivity analysis -- application to the local perturbation of heterogeneity distribution for history matching (Q1710278) (← links)
• Calibration of categorical simulations by evolutionary gradual deformation method (Q1710349) (← links)
• Cache-efficient parallel eikonal solver for multicore CPUs (Q1710371) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (Q1711441) (← links)
• What can knowledge of the energy landscape tell us about animal movement trajectories and space use? A case study with humans (Q1712658) (← links)
• Alternating evolution methods for static Hamilton-Jacobi equations (Q1715824) (← links)
• Heuristics for routing heterogeneous unmanned vehicles with fuel constraints (Q1717710) (← links)
• Applying 3D polygonal mesh watermarking for transmission security protection through sensor networks (Q1718081) (← links)
• Multiobjective optimization for a wireless ad hoc sensor distribution on shaped-bounded areas (Q1721436) (← links)
• Identifying systemically important financial institutions: a network approach (Q1722754) (← links)
• A biobjective Dijkstra algorithm (Q1728479) (← links)
• A multiple objective transportation problem approach to dynamic truck dispatching in surface mines (Q1728512) (← links)
• The charge-carrier mobility in disordered organic materials: the long-range one-dimensional diffusion with the memory effect (Q1742802) (← links)
• Special cases of the quadratic shortest path problem (Q1743483) (← links)
• The stochastic queue core problem, evacuation networks, and state-dependent queues (Q1750487) (← links)
• Shortest path algorithms for functional environments (Q1751143) (← links)
• Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
• A hybrid particle swarm optimization -- variable neighborhood search algorithm for constrained shortest path problems (Q1753628) (← links)
• Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles (Q1754047) (← links)
• Multicommodity flows and Benders decomposition for restricted continuous location problems (Q1754155) (← links)
• Itinerary planning with time budget for risk-averse travelers (Q1754240) (← links)
• The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341) (← links)
• Solving the geometric firefighter routing problem via integer programming (Q1755409) (← links)