[PDF] Top 20 A Heuristic Approach for Minimum Set Cover Problem

A Heuristic Approach for Minimum Set Cover Problem

... Abstract—The Minimum Set Cover Problem has many prac- tical applications in various research ...This problem belongs to the class of NP-hard theoretical ...this problem and ... See full document

6

Marta Mesquita, Margarida Moz, Ana Paias and Margarida Pato

... The problem addressed aims to assign drivers of a company to vehicles and vehicles to a set of pre-defined timetabled trips that cover passenger transport demand on a specific area, during a planning ... See full document

28

Solving a Bi-objective Nurse Rerostering Problem by Using a Utopic Pareto Genetic Heuristic

... a set of real life instances, taken from a specialised central hospital, produced a significant advantage over the previous single-objective ...genetic heuristic is ...this heuristic is now being ... See full document

22

A Novel Approach to Find Pseudo–peripheral Vertices for Snay’s Heuristic

... Snay’s heuristic [19] is a reasonable choice when the heuristic is applied to very small ...Snay’s heuristic can achieve) of an instance. The user can set the ν value depending on the class of ... See full document

13

HIDING SENSITIVE ASSOCIATION RULE USING HEURISTIC APPROACH

... this problem, [6] introduced a representation of association rules, called representative rules ...a set of rules that allow deducing all association rules without accessing a ...The cover operator ... See full document

7

A Hybrid Genetic Algorithm Approach for Concave Minimum Cost Network Flow Problems

... the problem set described in ...DP approach [4] for problem instances with up to 19 vertices and to heuristic solutions found by a local search algorithm [5], for larger size ... See full document

6

Heuristic Placement Routines for Two-Dimensional Bin Packing Problem

... Abstract. Problem statement: Cutting and packing (C and P) problems are optimization problems that are concerned in finding a good arrangement of multiple small items into one or more larger ...packing ... See full document

8

Heuristic Algorithms for Geometric Embedding of Complete Binary Trees onto a Point-set

... the minimum spanning tree of the ...embedding problem properly while the result of X Median or Y Median is not sufficiently ...of minimum spanning tree of the same ...of minimum spanning tree ... See full document

5

A decomposition heuristic for the maximal covering location problem

... decomposition approach based on the Lagrangean relaxation with clusters LagClus of Ribeiro and Lorena 19–22 is ...that problem using this cluster relaxation ...This problem consists of arranging ... See full document

13

Constraint-based modeling of Minimum Set Covering: Application to Species Differentation

... the problem of finding all minimum sets of restriction en- zymes that can be used to unequivocally identify the species of a yeast specimen by analyzing the size of digested DNA fragments in gel ... See full document

62

A Decomposition-based Heuristic Approach to Solve General Delivery Problem

... planning problem, General Delivery Problem (GDP). Such problem is more general than well-known Vehicle Routing ...original problem into a set of sub-problems, which can reduce the ... See full document

5

Job shop scheduling with makespan objective: A heuristic approach

... parallel approach was used to parallelize the genetic algorithm and to accelerate the creation of the initial population of genetic ...the problem are: (Gao et ... See full document

8

AliquotG: an improved heuristic algorithm for genome aliquoting.

... To describe the genome aliquoting problem, a rearrangement operation (or model) is needed. Here we use the DCJ operation [6]. Each DCJ operation cuts two adjacencies and rejoins the four free extremities ... See full document

8

en 0104 530X gp 0104 530X2647 16

... aggregation heuristic (presented in Section ...constructive heuristic using the following items: if the partition in the subproblems was temporal, based on the resource (harvesting fronts) or a combination ... See full document

16

Programação e sequenciamento das frentes de colheita de cana-de-açúcar: modelo e métodos de solução para problemas de grande porte

... aggregation heuristic (presented in Section ...constructive heuristic using the following items: if the partition in the subproblems was temporal, based on the resource (harvesting fronts) or a combination ... See full document

16

Spreadsheet Heuristic for Stochastic Demand Environments to Solve the Joint Replenishment Problem

... inventory problem can be decomposed into several single-item inventory problems, each with occasional opportunities for discount replenishments, and solved by successive ...single-item problem with a ... See full document

6

Uma heurística robusta para programação de máquinas paralelas com tempos de setup dependentes da sequência

... the problem of minimizing makespan on m-parallel machine with setup times separated of processing times of jobs and ...efficient heuristic was proposed and computationally ...the heuristic solution ... See full document

19

A hybrid heuristic algorithm for the open-pit-mining operational planning problem

... Planning problem with dynamic truck ...this problem is NP- hard, so a heuristic strategy is ...a set of real-data problems and the results were validated by running the CPLEX optimizer with ... See full document

11

A fuzzy AHP approach for employee recruitment

... Step 1: The first step of FAHP consists of developing a hierarchical structure of the assessment problem. After developing the performance hierarchy, decision makers have to determine the relative weights of each ... See full document

10

A Fast Heuristic for a Lot Splitting and Scheduling Problem of a Textile Industry

... step heuristic algorithm for the identical parallel machine scheduling problem with job splitting and with sequence dependent setup times, aiming at minimizing the ...the problem is reduced into a ... See full document

6