Results 21 to 30 of about 1,485,911 (189)
THE MODEL FOR DETERMINING LOCATION OF NAVAL BASE USING AHP METHOD AND SET COVERING PROBLEM [PDF]
Russian Journal of Agricultural and Socio-Economic Sciences, 2020 Indonesia is a nation that has a lot of island with most of its territory (2/3) is the sea and the rest of it (1/3) island that consist of many islands, this kind of geographical condition insist Indonesian Government control and guaranty its sea ...
Purnomo J. +3 more
doaj +1 more source
Unsplittable coverings in the plane [PDF]
, 2015 A system of sets forms an {\em $m$-fold covering} of a set $X$ if every point of $X$ belongs to at least $m$ of its members. A $1$-fold covering is called a {\em covering}.
A Asinowski +28 more
core +4 more sources
Mathematics, 2023 This research aims to explain the intrinsic difficulty of Karp’s list of twenty-one problems through the use of empirical complexity measures based on the ellipsoidal width of the polyhedron generated by the constraints of the relaxed linear programming ...
Ivan Derpich, Juan Valencia, Mario Lopez
doaj +1 more source
The minimum-entropy set cover problem
Theoretical Computer Science, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Halperin, Eran, Karp, Richard M.
openaire +2 more sources
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhao, Gao, Xiaofeng, Wu, Weili
openaire +1 more source
A column generation approach to the airline crew pairing problem to minimize the total person-days
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not violate ...
Wei WU +5 more
doaj +1 more source
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility [PDF]
, 2013 We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the ILP Feasibility
Kratsch, Stefan
core +1 more source
The dynamic set covering próblem
Applied Mathematical Modelling, 1982 This paper addresses a dynamic version of the set covering formulation for facility location problems. The problem is characterized by 0–1 cover coefficients that may change value from one time period to the next. Included is a discussion of model formulation considerations, solution procedures and applications areas.
Chrissis, James W. +2 more
openaire +1 more source
A set-covering formulation for a drayage problem with single and double container loads
Journal of Industrial Engineering International, 2018 This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port.
A. Ghezelsoflu +3 more
doaj +1 more source