Font Size:
a
A
A
Keyword [NP-hard]
Result: 41 - 60 | Page: 3 of 3
41.
The Design Of Algorithms And Analyses Of Three Optimization Problems
42.
Path Relinking In Hybrid Heuristic Algorithms For Combinatorial Optimization Problems
43.
Effective Heuristic Algorithms For The Minimum Weight Vertex Cover And The Linear Ordering Optimization Problems
44.
Research On Scheduling For Minimizing Total Weighted Completion Time Under Typical Environments
45.
Research On Several Network Optimization Problems Of Cycles And Trees
46.
Heuristic Optimization Of The Binary-morse Cluster
47.
The Study Of Pricing Model
48.
Single-machine Rescheduling Problems With Rejection
49.
Rescheduling Problems With Deteriorating Jobs Under Sequence Disruptions
50.
Research On Iterative Local Search Algorithm For Dispersion Problems
51.
Research On Kemelization Algorithm For Maximal Strip Recovery Problem In Genome
52.
Matching Problem Under Linear Constraint
53.
Design And Analysis Of Reclaimer Scheduling In Terminal Yard
54.
Generation of tightly controlled equivalence classes for experimental design of heuristics for graph-based NP-hard problems
55.
Algorithmic Aspects On The Minimal Doubly Resolving Set Problem Of Graphs
56.
A Clustering Based Iterated Hybrid Search For Vertex Bisection Problem
57.
An Approximate Algorithm For STC Problem
58.
Scheduling Problems With Job Cumulative Effects
59.
Research On Ddos Mitigation Methods In Edge Computing Based On Game Theory
60.
Theoretical Study Of Coherent Ising Machine With Squeezed Feedback System
<<First
<Prev
Next>
Last>>
Jump to
