np-hard

Since the majority of scheduling problems, particularly the practical ones, are NP-hard, approximation algorithms are needful to solve them.

As a classical Combinatorial optimization problem, resource-constrained project scheduling problem belongs to NP-Hard puzzle in theory.

The path packing problem is an optimization problem with many important applications. However, it is NP-hard in computational complexity.

The optimal layout problem of circle group in a circular container with performance constraints of equilibrium belong to NP-hard problem.

VSP is a typical NP-hard problem and is difficult to be solved by using pure mathematical methods.

A self-adaptive chaotic control strategy is incorporated into standard genetic algorithm (GA) because its NP hard to solve FST.

Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem and NP-hard.

The model is in fact a special type of classic location-allocation models and has NP-hard complexity.

Task scheduling problem has been proved to be NP hard, so most task scheduling algorithms are mainly based on heuristics method.

Attribute reduction in rough set theory is a NP-hard problem, which is studied mainly to design a more efficient algorithm.

The vehicle scheduling problem is a NP-hard problem without polynomial time algorithm.

An aircraft sequencing problem (ASP) is a non-deterministic polynomial hard (NP-hard) problem, which is hard to resolve.

It proves that the optimal transmission ranges for all areas is a multi-objective optimization problem(MOP), which is NP hard.

The multi-mode resource-constrained project scheduling problem is a kind of NP-hard combination optimization problem.

The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.

QAP belong to the NP-Hard problems, which cant be solved in polynomial time.

The cut width problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.

We show that the scheduling problem is NP-hard in the strong sense.

Maximal profit item selection problem is a NP hard problem, it can be solved by a known quadratic programming which is NP complete.

For general graph, it is a NP-hard question to get the bondage number or reinforcement number.

Traveling Salesman Problem(TSP) is a classic combined optimization problem and it is proved that TSP is NP hard.

As MPGP and QAP are NP-hard, genetic algorithm (GA) is employed as solving algorithm.

Though it is NP hard , we will get a approximation algorithm according to the Chapter 2's research frame.

How to find a minimum dominating set for a network is a NP -hard problem.

A Study on Global Optimization for NP Hard Problems in Power System

Some Efficient Algorithms for NP-hard Program