Results 1 to 10 of about 2,347,375 (169)
Multi-objective database queries in combined knapsack and set covering problem domains [PDF]
Database queries are one of the most important functions of a relational database. Users are interested in viewing a variety of data representations, and this may vary based on database purpose and the nature of the stored data.
Sean A. Mochocki +3 more
doaj +2 more sources
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem [PDF]
This paper proposes an algorithm for the set covering problem based on the metaheuristic Ant Colony Optimization (ACO) called Ant-Set, which uses a lineoriented approach and a novelty pheromone manipulation based on the connections between components of ...
Murilo Falleiros Lemos Schmitt +4 more
doaj +3 more sources
Strategic planning for the supply chain is part of the planning process for the supply chain management. One part of this process is figuring out the supply chain's infrastructure and physical structure.
Fitri Agustina +3 more
doaj +1 more source
The distribution or delivery process is one factor that affect customer satisfaction as the goal of supply chain. In order for supply chain to be competitive in competition, delivery time is an important factor to manage, so that it could provide high ...
Rainisa Maini Heryanto, Santoso Santoso
doaj +1 more source
Set Covering Problem in Transport Nets Expanding Models [PDF]
The article deals with the problem of optimal coverage of utility centres in transport network. We can often encounter similar types of tasks in a real life.
Dušan TEICHMANN +2 more
doaj +1 more source
Efficient Neighborhood Covering Model Based on Triangle Inequality Checkand Local Strategy [PDF]
Neighborhood covering model is widely used in classification tasks for its simple mechanism and ability to handle complex data.However,the neighborhood covering model has the problem of low efficiency and lack of related research work.To solve this ...
CHEN Yu-si, AI Zhi-hua, ZHANG Qing-hua
doaj +1 more source
On The Study of Edge Monophonic Vertex Covering Number
For a connected graph G of order n ≥ 2, a set S of vertices of G is an edge monophonic vertex cover of G if S is both an edge monophonic set and a vertex covering set of G.
K.A Francis Jude Shini +3 more
doaj +1 more source
This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning
Roghayyeh Alizadeh, Tatsushi Nishi
doaj +1 more source
A Surprisal-Based Greedy Heuristic for the Set Covering Problem
In this paper we exploit concepts from Information Theory to improve the classical Chvatal greedy algorithm for the set covering problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the ...
Tommaso Adamo +3 more
doaj +1 more source
Cyber Risk Assessment and Optimization: A Small Business Case Study
Assessing and controlling cyber risk is the cornerstone of information security management, but also a formidable challenge for organisations due to the uncertainties associated with attacks, the resulting risk exposure, and the availability of scarce ...
Maria Tsiodra +3 more
doaj +1 more source

