• No results found

NP-hard routing problem

A Distributed framework for mobile data gathering with concurrent data uploading & Data Retrieval Scheduling in wireless sensor

A Distributed framework for mobile data gathering with concurrent data uploading & Data Retrieval Scheduling in wireless sensor

... a problem called largest number data retrieval ...decision problem of LNDR is NP-hard, which aims at downloading a set of requested data items with the least response time and energy ...

5

A novel encoding scheme based evolutionary approach for the bi-objective grid patrol routing problem with multiple vehicles

A novel encoding scheme based evolutionary approach for the bi-objective grid patrol routing problem with multiple vehicles

... Patrol Routing Problem (BGPRP) in which multiple patrol vehicles have to cooperatively patrol several nodes for a given specic time during a certain planning horizon in a grid ...an NP-hard ...

10

A Novel Three-Phase Approach for Solving Multi-Depot Vehicle Routing Problem with Stochastic Demand

A Novel Three-Phase Approach for Solving Multi-Depot Vehicle Routing Problem with Stochastic Demand

... Vehicle Routing Problem (MDVRP), an extension of classical VRP, is a NP-hard problem for simultaneously determining the routes for several vehicles from multiple depots to a set of ...

5

INCREASING THE LIFE SPAN OF BACKBONE NETWORKS

INCREASING THE LIFE SPAN OF BACKBONE NETWORKS

... delay routing problem in the context of distributed networks with and without partial load ...delay routing problem is NP hard, assuming uniformly distributed K ...

8

Enhancement of Firefly Technique for Effective Optimization of Multi Depot Vehicle Routing

Enhancement of Firefly Technique for Effective Optimization of Multi Depot Vehicle Routing

... Vehicle Routing Problem (VRP) plays a significant role in today’s demanding world, especially in Logistics, Disaster relief supplies or Emergency transportation, Courier services, ATM cash replenishment, ...

8

An Analysis of New Optimization Algorithm for Different Combinatorial Problems

An Analysis of New Optimization Algorithm for Different Combinatorial Problems

... Vehicle routing problem is one of the NP- hard ...The problem describes that to design a least cost routes for fleet of ...vehicle routing problem by Tabu search ...

6

Firefly Algorithm to Solve Two Dimensional Bin          Packing Problem

Firefly Algorithm to Solve Two Dimensional Bin Packing Problem

... Best-Fit (BFA) is simple and behaves well in practice. Best-Fit (BF) is the best known algorithm for Bin Packing problem. It picks the bin with the least amount of free space in which it can still hold the ...

6

An FPT haplotyping algorithm on pedigrees with a small number of sites

An FPT haplotyping algorithm on pedigrees with a small number of sites

... our problem can be reduced to the problem of finding the line index of a signed graph [8] with additional parity ...(GBER) problem with parity constraints. The GBER problem is fixed-para- ...

8

Optimal content replication and request matching in large caching systems

Optimal content replication and request matching in large caching systems

... the problem of computing the optimal replication policy which if combined with the optimal matching policy maximizes the throughput of the caching system in the stationary ...an NP-hard ...the ...

10

An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem

An enhanced invasive weed optimization for makespan minimization in a flexible flowshop scheduling problem

... shop problem were proposed by many authors, ...makespan problem with two stages and only one machine at stage ...tardiness. Problem instances of up to 15 jobs were illustrated to be solvable in ...

14

Integrated production and distribution scheduling for perishable products

Integrated production and distribution scheduling for perishable products

... their NP-hardness or providing polynomial ...the problem that jointly considers production and delivery with the consideration that each job may require a dierent amount of space during intractable ...

14

Approximation and elections

Approximation and elections

... Example 6.2.4. Perhaps the most straightforward example of an instance of such a problem would be to imagine that you are packing for a backpacking trip and you want to make sure that you get exactly one item from ...

90

A Zero-Knowledge Proof Based on a Multivariate Polynomial Reduction of the Graph Isomorphism Problem

A Zero-Knowledge Proof Based on a Multivariate Polynomial Reduction of the Graph Isomorphism Problem

... Isomorphism problem (GI), where a prover must convince the verifier that he knows an isomorphism between two isomorphic graphs without publishing the ...the NP-hard problem of finding the ...

9

Nonnegative factorization and the maximum edge biclique problem

Nonnegative factorization and the maximum edge biclique problem

... This problem was first introduced in 1994 by Paatero and Tapper [26], and more recently received a considerable interest after the publication of two papers by Lee and Seung [21, ...a NP-hard ...

21

A fixed point iterative approach to integer programming and its distributed computation

A fixed point iterative approach to integer programming and its distributed computation

... proposed in [, ]. The method simply checks a minimal set of points in the neighbor- hood of a feasible point to determine whether one of them is in the polytope or yields a better objective function value. The ...

15

Genetic Algorithm Parameter Control: Application to Scheduling with Sequence-Dependent Setups

Genetic Algorithm Parameter Control: Application to Scheduling with Sequence-Dependent Setups

... this problem class include Partially Matched Crossover (PMX) [20] and Uniform Par- tially Matched Crossover (UPMX) ...other routing and scheduling prob- ...introduce problem-dependent knowledge into ...

8

Complexity of n-Queens completion (extended abstract)

Complexity of n-Queens completion (extended abstract)

... -Queens problem is often misunder- stood. The decision problem is solvable in constant time since there is a solution for all n > 3 so is only NP- hard if ...-Queens problem has ...

5

Solution of P versus NP problem

Solution of P versus NP problem

... To understand the importance of the P versus NP problem let us imagine a world where P=NP. Technically we could have P = NP, but not have practical algorithms for most NP-complete ...

7

Three meta-heuristics to solve the no-wait two-stage assembly flow shop scheduling problem

Three meta-heuristics to solve the no-wait two-stage assembly flow shop scheduling problem

... shop problem, is modeled into Mixed-Integer Linear Programming ...the problem with bi-criteria of maximum lateness and makespan minimization in which PSO was again shown to be the best ...

9

Multi-Scenarios Dynamic Matching Algorithm for Hierarchical Treatment System

Multi-Scenarios Dynamic Matching Algorithm for Hierarchical Treatment System

... (TSM) problem in hierarchical medical system, a matching decision-making approach based on multiple scenarios was ...the problem of “hierarchical treatment system” around the ...

12

Show all 10000 documents...

Related subjects