Scholars Central

Search Scholars Central

Articles, journals and conferences in one search. An exact title, DOI or ISSN is listed first.

Advanced searchHide advanced search

In the search box: "exact phrase" · -leave out · OR · prefix* · title: author: journal:

Years

1–25 of 51 articles for NP-hard

Then save them, add them to a collection or cite them together.
  1. Research article · Jan 2014

    Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time

    International Journal of Innovative Research in Computer and Communication Engineering · Volume 2, Issue 1

    most probable delay of a given graph having node(n) and edges (m) is NP-Hard problem. The hardness of the problem doesn‟t impact on the restricted version problem ... solve the problem with the help of applying some…

  2. Conference abstract · 17 Aug 2015

    Algorithms for optimal scheduling of multiple spacecraft maneuvers

    which involve a mixture of continuous and discrete decision variables, and belong to the NP-hard class of optimization problems that are difficult to solve. Recently, novel algorithms inspired ... optimization, and have…

  3. Conference abstract · 25 Sep 2017

    Memories-based genetic algorithm software

    time in a hub-and-center network under uncertain environments. As the FCSApHCP is NP-hard, a novel approach called memories-based genetic algorithm (MGA) is developed to solve

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels