• Aucun résultat trouvé

[PDF] Top 20 On the Quadratic Shortest Path Problem

Has 10000 "On the Quadratic Shortest Path Problem" found on our website. Below are the top 20 most common "On the Quadratic Shortest Path Problem".

On the Quadratic Shortest Path Problem

On the Quadratic Shortest Path Problem

... also the cost of the interactions among the arcs in the ...a problem Quadratic Shortest Path Problem ...(QSPP). The first variant of the SPP ... Voir le document complet

13

On the complexity of the shortest-path broadcast problem

On the complexity of the shortest-path broadcast problem

... study the shortest-path broadcast problem in graphs and digraphs, where a message has to be transmitted from a source node s to all the nodes along shortest paths, in the ... Voir le document complet

16

A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution

A new shortest path algorithm to solve the resource-constrained project scheduling problem with routing from a flow solution

... A shortest path algorithm is proposed to solve this problem with a labeling dynamic approach where a label provides all of the information about a solution, including the objective ... Voir le document complet

16

Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks

Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks

... We consider the shortest path problem in networks with time windows and linear waiting costs (SPWC), and the minimum travel time reoptimization problem for earlier a[r] ... Voir le document complet

104

An auction/sequential shortest path algorithm for the minimum cost network flow problem

An auction/sequential shortest path algorithm for the minimum cost network flow problem

... By the theory of the auction/shortest path algorithm, a shortest path in the reduced graph will be found in a finite number of iterations if there exists at lea[r] ... Voir le document complet

20

Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks

Visibility-Graph-based Shortest-Path Geographic Routing in Sensor Networks

... study the problem of shortest-path geographic routing in a static sensor ...in the worst case a route produced by any localized algorithm has length Ω(c 2 ), which can be arbitrarily ... Voir le document complet

10

Some Theoretical Links Between Shortest Path Filters and Minimum Spanning Tree Filters

Some Theoretical Links Between Shortest Path Filters and Minimum Spanning Tree Filters

... fundamental problem in com- puter vision for several ...and the desired prop- erties of a filter can thus be explained using a denoising application: real world images often contain noise and irrelevant ... Voir le document complet

19

Constrained Path Planning using Quadratic Programming

Constrained Path Planning using Quadratic Programming

... enforcing the constraints at each intermediate ...as the ones considered before. The main difference is that regarding the objective the local goal is set to be the initial ... Voir le document complet

7

A parallel tabu search for the unconstrained binary quadratic programming problem

A parallel tabu search for the unconstrained binary quadratic programming problem

... actually the core component of a number of other ...a path-relinking procedure, and im- proved by means of TS. The population updating mechanism is based on a distance-and-quality goodness score ... Voir le document complet

9

Choquet-based optimisation in multiobjective shortest path and spanning tree problems

Choquet-based optimisation in multiobjective shortest path and spanning tree problems

... Once the preference model of the decision maker is known in a multiobjective optimisation problem, there is no need to enumerate the entire set of Pareto-optimal ...Instead, the search ... Voir le document complet

29

An analysis of stochastic shortest path problems

An analysis of stochastic shortest path problems

... We consider a stochastic version of the classical shortest path problem whereby for each node of a graph, we must choose a probability distribution over the set of s[r] ... Voir le document complet

21

Multi-Objective Robotic Assembly Line Balancing Problem: A NSGA-II Approach Using Multi-Objective Shortest Path Decoders

Multi-Objective Robotic Assembly Line Balancing Problem: A NSGA-II Approach Using Multi-Objective Shortest Path Decoders

... Minimizing the total cost of robots used, (Z 3 ): Minimizing the number of workstations ...used. The problem has been introduced in Rubinovitz et ...where the basic assump- tions are ... Voir le document complet

5

A path following algorithm for the graph matching problem

A path following algorithm for the graph matching problem

... for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem ... Voir le document complet

28

Biological and Shortest-Path Routing Procedures for Transportation Network Design

Biological and Shortest-Path Routing Procedures for Transportation Network Design

... make the problem hardly solvable analytically and solutions are often explored using ...solutions. The first approach is what we call the biological approach. The reason for this name ... Voir le document complet

17

Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks

Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Networks

... nation shortest-path problem is to find shortest paths from all vertices in the graph to a single destination vertex ...and the length of a path corresponds to its sum of ... Voir le document complet

16

Disconnected components detection and rooted shortest-path tree maintenance in networks

Disconnected components detection and rooted shortest-path tree maintenance in networks

... isolates the nodes in all other connected ...solving the DCDSPM problem under the unfair daemon was known prior to this ...Thus the time complexity of algorithm FDcD improves the ... Voir le document complet

22

Space and Time Trade-Off for the k Shortest Simple Paths Problem

Space and Time Trade-Off for the k Shortest Simple Paths Problem

... be the shortest path from v 0 to t in T 0 . Note that the path Q(i, e) = (v 0 , · · · , v i , v 0 , P v 0 t(T 0 )) is a shortest extension of P 0 at e, but it is not necessarily ... Voir le document complet

14

The light prefers the shortest. Physics and geometry about shortest path problems from Heron to Fermat

The light prefers the shortest. Physics and geometry about shortest path problems from Heron to Fermat

... media: the beam curves! 3 Methodology One of the most important inspiring models for our educational experiment was Inquiry Based Science Education (IBSE) model, which proposes teaching activities based on ... Voir le document complet

13

Shortest Path Discovery Problem, Revisited (Query Ratio, Upper and Lower Bounds)

Shortest Path Discovery Problem, Revisited (Query Ratio, Upper and Lower Bounds)

... Consider the following problem: given two nodes s and t in a fully connected graph where each edge of the graph has a hidden length, discover the shortest path between s and ... Voir le document complet

17

On the Hardness of Equal Shortest Path Routing

On the Hardness of Equal Shortest Path Routing

... is the set of nodes, A is the set of arcs, and c is the capacity function that assigns to each arc (u, v) a capacity c(u, v), and two vertices s, t ∈ V , respectively the source and the ... Voir le document complet

17

Show all 10000 documents...