|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 160 occurrences of 123 keywords
|
|
|
Results
Found 544 publication records. Showing 544 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
68 | Yan Wang 0014, Jianguo Lu, Jessica Chen |
Crawling Deep Web Using a New Set Covering Algorithm. |
ADMA |
2009 |
DBLP DOI BibTeX RDF |
deep web crawling, greedy algorithm, set covering problem |
61 | Paulo F. Flores, Horácio C. Neto, João P. Marques Silva |
On Applying Set Covering Models to Test Set Compaction. |
Great Lakes Symposium on VLSI |
1999 |
DBLP DOI BibTeX RDF |
Test Set Compaction, Unate Covering Problem, Test Pattern Generation, Set Covering |
54 | Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo |
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. |
Ann. Oper. Res. |
2006 |
DBLP DOI BibTeX RDF |
Set covering problem, Lagrangean relaxation, Multi-objective combinatorial optimization |
51 | J. Orestes Cerdeira, Leonor Santiago Pinto |
Requiring Connectivity in the Set Covering Problem. |
J. Comb. Optim. |
2005 |
DBLP DOI BibTeX RDF |
integer polytopes, graphs, set covering, connected components |
45 | Xunkai Wei, Ying-Hong Li 0003, Yufei Li |
Optimum Neural Network Construction Via Linear Programming Minimum Sphere Set Covering. |
ADMA |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Rong Long Wang, Kozo Okazaki |
An improved genetic algorithm with conditional genetic operators and its application to set-covering problem. |
Soft Comput. |
2007 |
DBLP DOI BibTeX RDF |
Genetic algorithm, Combinatorial optimization, Genetic operator, Set-covering problem |
41 | Broderick Crawford, Carolina Lagos, Carlos Castro 0001, Fernando Paredes |
A Cultural Algorithm for Solving the Set Covering Problem. |
Analysis and Design of Intelligent Systems using Soft Computing Techniques |
2007 |
DBLP DOI BibTeX RDF |
Genetic and Evolutionary Computation, Cultural Algorithms, Set Covering Problem |
41 | Andrzej Jaszkiewicz |
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm. |
Ann. Oper. Res. |
2004 |
DBLP DOI BibTeX RDF |
metaheuristics, set covering problem, multiple-objective optimization |
37 | Hideki Hashimoto, Youichi Ezaki, Mutsunori Yagiura, Koji Nonobe, Toshihide Ibaraki, Arne Løkketangen |
A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route. |
SLS |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Roghayyeh Alizadeh, Tatsushi Nishi |
Hybrid Covering Location Problem: Set Covering and Modular Maximal Covering Location Problem. |
IEEM |
2019 |
DBLP DOI BibTeX RDF |
|
34 | Ronak Desai, Qi Yang 0011, Zonghuan Wu, Weiyi Meng, Clement T. Yu |
Identifying redundant search engines in a very large scale metasearch engine context. |
WIDM |
2006 |
DBLP DOI BibTeX RDF |
redundant search engine identification, set-covering problem |
34 | Shantanu Biswas, Y. Narahari |
Iterative Dutch combinatorial auctions. |
Ann. Math. Artif. Intell. |
2005 |
DBLP DOI BibTeX RDF |
iterative auctions, generalized Vickrey auctions, weighted set packing problem, weighted set covering problem, e-selling, efficiency, combinatorial auctions, incentive compatibility, e-procurement |
34 | Zakria Hussain, John Shawe-Taylor |
Using Generalization Error Bounds to Train the Set Covering Machine. |
ICONIP (1) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Raymond S. K. Kwan, Ann S. K. Kwan |
Effective search space control for large and/or complex driver scheduling problems. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
Driver scheduling, Heuristics, Set covering, Public transport |
33 | Federico Della Croce, Vangelis Th. Paschos |
Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. |
Oper. Res. |
2008 |
DBLP DOI BibTeX RDF |
Dominance conditions, Set covering, Max cut, Worst-case complexity |
33 | Dimitri Marinakis, Philippe Giguère, Gregory Dudek |
Learning Network Topology from Simple Sensor Data. |
Canadian AI |
2007 |
DBLP DOI BibTeX RDF |
sensor networks, mapping, set-covering, topology inference |
33 | Anita Schöbel |
Locating Stops Along Bus or Railway Lines - A Bicriteria Problem. |
Ann. Oper. Res. |
2005 |
DBLP DOI BibTeX RDF |
bicriterial, dynamic programming, location, set covering, public transportation |
30 | Tínaz Ekim, Vangelis Th. Paschos |
Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation. |
Int. J. Comput. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
29 | V. S. Anil Kumar 0001, Sunil Arya, H. Ramesh |
Hardness of Set Cover with Intersection 1. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
28 | Markus Finger, Thomas Stützle, Helena R. Lourenço |
Exploiting Fitness Distance Correlation of Set Covering Problems. |
EvoWorkshops |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Renato Bruni |
Reformulation of the support set selection problem in the logical analysis of data. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
Logical analysis of data, Data mining, Classification, Set covering, Massive data sets |
28 | Anureet Saxena, Vineet Goyal, Miguel A. Lejeune |
MIP reformulations of the probabilistic set covering problem. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C15, 90-08, 90C10 |
28 | Ian Cloete, Jacobus van Zyl |
Fuzzy rule induction in a set covering framework. |
IEEE Trans. Fuzzy Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Nysret Musliu |
Local Search Algorithm for Unicost Set Covering Problem. |
IEA/AIE |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Michael G. Dimopoulos, Panagiotis Linardis |
Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques. |
DATE |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Ian Cloete, Jacobus van Zyl |
A machine learning framework for fuzzy set covering algorithms. |
SMC (4) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Christian Plessl, Marco Platzner |
Custom Computing Machines for the Set Covering Problem. |
FCCM |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Xue-Bin Liang |
Matrix games in the multicast networks: maximum information flows with network switching. |
IEEE Trans. Inf. Theory |
2006 |
DBLP DOI BibTeX RDF |
achievable information rate regions, matrix games, max-flow min-cut theorems, maximum information flows, multisource multicast networks, network switching, route packings, switching gaps, game theory, network coding, multicast routes, set-covering problems |
27 | Britton Harris |
Two Algorithms for the Multi-Weber Problem. |
Ann. Oper. Res. |
2003 |
DBLP DOI BibTeX RDF |
optimality, partitioning, set-covering |
27 | Chauchin Su, Shyh-Shen Hwang, Shyh-Jye Jou, Yuan-Tzu Ting |
Syndrome Simulation And Syndrome Test For Unscanned Interconnects. |
Asian Test Symposium |
1996 |
DBLP DOI BibTeX RDF |
unscanned interconnects, syndrome test methodology, event driven syndrome simulation, boundary scan environment, faulty syndromes, fault-free syndromes, tolerable error rate, partially scanned PCB, board level testing, test pattern generation, boundary scan testing, test length, MCM, set covering problem, simulation algorithm, weighted random patterns, test cost reduction |
25 | Rocío Santillán Rodríguez, Carolina Yolanda Castañeda Roldán, Javier Garcés Eisele, Ma. del Pilar Gómez Gil, Mauricio Javier Osorio Galindo |
Algorithms for the Typing of Related DNA Sequences. |
CONIELECOMP |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Liang Chen, Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Tao Quan, Juan Chen |
Efficient presolving methods for solving maximal covering and partial set covering location problems. |
Eur. J. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Jean-François Cordeau, Fabio Furini, Ivana Ljubic |
Benders decomposition for very large scale partial set covering and maximal covering location problems. |
Eur. J. Oper. Res. |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Qiu Jin, Lingqiang Li, Shoubin Sun |
On covering generalized rough set: Covering rough membership function. |
FSKD |
2012 |
DBLP DOI BibTeX RDF |
|
23 | Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 |
Minimum Membership Set Covering and the Consecutive Ones Property. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Hans A. Kestler, Wolfgang Lindner 0002, André Müller |
Learning and Feature Selection Using the Set Covering Machine with Data-Dependent Rays on Gene Expression Profiles. |
ANNPR |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Lucas Lessing, Irina Dumitrescu, Thomas Stützle |
A Comparison Between ACO Algorithms for the Set Covering Problem. |
ANTS Workshop |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Fernando Borrás, Jesús T. Pastor |
The Ex-Post Evaluation of the Minimum Local Reliability Level: An Enhanced Probabilistic Location Set Covering Model. |
Ann. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Qiuhua Zheng, Weihua Hu, Yuntao Qian, Min Yao, Xianglin Wang, Jing Chen |
A Novel Approach for Network Event Correlation Based on Set Covering. |
FSKD (3) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Ke-rui Weng, Yijuan Wang |
Evolutionary Algorithms for Multiple Allocation Hub Set Covering Problem. |
ICNSC |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Torsten Fahle, Karsten Tiemann |
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. |
ACM J. Exp. Algorithmics |
2006 |
DBLP DOI BibTeX RDF |
test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem |
21 | Federico Della Croce, Vangelis Th. Paschos |
Computing Optimal Solutions for the min 3-set covering Problem. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
21 | François Laviolette, Mario Marchand, Mohak Shah |
Margin-Sparsity Trade-Off for the Set Covering Machine. |
ECML |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Janusz Kacprzyk, Grazyna Szkatula |
An Inductive Learning Algorithm with a Partial Completeness and Consistence via a Modified Set Covering Problem. |
ICANN (2) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Malek Rahoual, Riad Hadji, Vincent Bachelet |
Parallel Ant System for the Set Covering Problem. |
Ant Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Sofia Kovaleva, Frits C. R. Spieksma |
Approximation of a Geometric Set Covering Problem. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Alberto Caprara, Matteo Fischetti, Paolo Toth |
A Heuristic Algorithm for the Set Covering Problem. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Nan-Chi Chou, Lung-Tien Liu, Chung-Kuan Cheng, Wei-Jin Dai, Rodney Lindelof |
Local ratio cut and set covering partitioning for huge logic emulation systems. |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Harvey M. Salkin, Ronald D. Koncal |
Set Covering by an All Integer Algorithm: Computational Experience. |
J. ACM |
1973 |
DBLP DOI BibTeX RDF |
|
20 | Hua Ni, Hernán G. Abeledo |
A branch-and-price approach for large-scale employee tour scheduling problems. |
Ann. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
Tour scheduling, Decomposition, Set-covering, Branch-and-price |
20 | Kwangsoo Kim, Hong Seo Ryoo |
Selecting Genotyping Oligo Probes Via Logical Analysis of Data. |
Canadian AI |
2007 |
DBLP DOI BibTeX RDF |
oligo probes, LAD, viral pathogens, optimization, microarrays, set covering, learning theory |
20 | Wingo Sai-Keung Wong, George Baciu |
A randomized marking scheme for continuous collision detection in simulation of deformable surfaces. |
VRCIA |
2006 |
DBLP DOI BibTeX RDF |
randomized marking scheme, interactive simulation, deformable surfaces, set-covering problems, continuous collision detection |
20 | Jon Lee 0001 |
Cropped Cubes. |
J. Comb. Optim. |
2003 |
DBLP DOI BibTeX RDF |
totally dual integral, ideal matrix, generalized set covering, clipped cube, cropped cube, balanced matrix, linear program, integer program, polytope |
20 | Anna Maria Brosa, Joan Figueras |
On Maximizing the Coverage of Catastrophic and Parametric Faults. |
J. Electron. Test. |
2000 |
DBLP DOI BibTeX RDF |
analog & mixed-signal testing, fault coverage, set covering problems |
20 | Tsong Yueh Chen, Man Fai Lau |
On the Minimal Essential Subsets and Minimal Representative Sets. |
Ada-Europe |
2000 |
DBLP DOI BibTeX RDF |
minimal essential set, minimal representative set, software testing, set covering, test suite reduction |
20 | Olivier Coudert, C.-J. Richard Shi |
Exact Dichotomy-based Constrained Encodi. |
ICCD |
1996 |
DBLP DOI BibTeX RDF |
Sequential logic synthesis, constrained state encoding, clique partition, set covering, dichotomy, ZBDD |
20 | Sardar Anisul Haque, Ali Jaoua, Jihad Mohamad Al Ja'am, Hafeez Ur Rehman |
Reducing a 3-SAT Instance to a Set of 2-SAT Instances Using the Idea of Set Covering Problem. |
ICCA |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Yu Yang 0014, Natashia Boland, Bistra Dilkina, Martin W. P. Savelsbergh |
Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. |
Eur. J. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Logan A. Smith, Illya V. Hicks |
New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
20 | André Manhães Machado, Geraldo Regis Mauri, Maria Cláudia Silva Boeres, Rodrigo de Alvarenga Rosa |
A new hybrid matheuristic of GRASP and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle routing problem. |
Expert Syst. Appl. |
2021 |
DBLP DOI BibTeX RDF |
|
20 | Murilo Falleiros Lemos Schmitt, Mauro Henrique Mulati, Ademir Aparecido Constantino, Fábio Hernandes, Tony Alexander Hild |
Ant-Set: A Subset-Oriented Ant Colony Optimization Algorithm for the Set Covering Problem. |
J. Univers. Comput. Sci. |
2020 |
DBLP BibTeX RDF |
|
20 | Lakmali Weerasena, Margaret M. Wiecek, Banu Soylu |
An algorithm for approximating the Pareto set of the multiobjective set covering problem. |
Ann. Oper. Res. |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Qingyuan Xu, Anhui Tan, Yaojin Lin |
A rough set method for the unicost set covering problem. |
Int. J. Mach. Learn. Cybern. |
2017 |
DBLP DOI BibTeX RDF |
|
20 | James N. K. Liu, Yan-Xing Hu, Yu-Lin He |
A set covering based approach to find the reduct of variable precision rough set. |
Inf. Sci. |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Kostas Florios, George Mavrotas |
Generation of the exact Pareto set in Multi-Objective Traveling Salesman and Set Covering Problems. |
Appl. Math. Comput. |
2014 |
DBLP DOI BibTeX RDF |
|
20 | Edoardo Amaldi, Sandro Bosio, Federico Malucelli |
Hyperbolic set covering problems with competing ground-set elements. |
Math. Program. |
2012 |
DBLP DOI BibTeX RDF |
|
20 | Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei |
The set covering problem on circulant matrices: polynomial instances and the relation with the dominating set problem on webs. |
Electron. Notes Discret. Math. |
2010 |
DBLP DOI BibTeX RDF |
|
20 | Silvia M. Bianchi, M. S. Montelar, Mariana S. Escalante |
Strength of facets for the set covering and set packing polyhedra on circulant matrices. |
Electron. Notes Discret. Math. |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Roelof K. Brouwer |
Fuzzy set covering of a set of ordinal attributes without parameter sharing. |
Fuzzy Sets Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Egon Balas, Manfred Padberg |
On the Set-Covering Problem: II. An Algorithm for Set Partitioning. |
Oper. Res. |
1975 |
DBLP DOI BibTeX RDF |
|
20 | Robert S. Garfinkel, George L. Nemhauser |
The Set-Partitioning Problem: Set Covering with Equality Constraints. |
Oper. Res. |
1969 |
DBLP DOI BibTeX RDF |
|
20 | Vangelis Th. Paschos |
A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. |
ACM Comput. Surv. |
1997 |
DBLP DOI BibTeX RDF |
approximation algorithms, constrained optimization, combinatorial algorithms, algorithm analysis, problem complexity |
18 | Steffen Mecke, Dorothea Wagner |
Solving Geometric Covering Problems by Data Reduction. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Vladimir Marianov, Daniel Serra |
Location-Allocation of Multiple-Server Service Centers with Constrained Queues or Waiting Times. |
Ann. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
heuristics, location, queuing |
16 | Gershon Elber, Robert Sayegh, Gill Barequet, Ralph R. Martin |
Two-Dimensional Visibility Charts for Continuous Curves. |
SMI |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Zilong Feng, Hiroyuki Okamura, Tadashi Dohi, Won Young Yun |
Reliability Computing Methods of Probabilistic Location Set Covering Problem Considering Wireless Network Applications. |
IEEE Trans. Reliab. |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Chuan Luo 0002, Wenqian Xing, Shaowei Cai 0001, Chunming Hu |
NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem. |
IEEE Trans. Cybern. |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Kedong Yan, Lin Xu, Yixin Zhao, Cui Guo |
Feature Selection via Nonlinear Set Covering in Logical Analysis of Data. |
J. Circuits Syst. Comput. |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Alice Calamita, Ivana Ljubic, Laura Palagi |
Benders decomposition for congested partial set covering location with uncertain demand. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Jannis Blauth, Antonia Ellerbrock, Vera Traub, Jens Vygen |
Cost Allocation for Set Covering: the Happy Nucleolus. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Clarivando Francisco Belizário Júnior, Fabiano Azevedo Dorça, Luciana Pereira de Assis, Alessandro Vivas Andrade |
Advances in personalised recommendation of learning objects based on the set covering problem using ontology. |
Int. J. Learn. Technol. |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Anupam Gupta 0001, Gregory Kehne, Roie Levin |
Set Covering with Our Eyes Wide Shut. |
SODA |
2024 |
DBLP DOI BibTeX RDF |
|
15 | Stephen J. Maher, Elina Rönnberg |
Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems. |
Math. Program. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Wen Sun 0005, Wenlong Li, Jin-Kao Hao, Qinghua Wu 0002 |
Learning-based multi-start iterated local search for the profit maximization set covering problem. |
Inf. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Florin Leutwiler, Francesco Corman |
Set covering heuristics in a Benders decomposition for railway timetabling. |
Comput. Oper. Res. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Selcen Gülsüm Aslan Özsahin, Babek Erdebilli |
Statistical-machine-learning-based intelligent relaxation for set-covering location models to identify locations of charging stations for electric vehicles. |
EURO J. Transp. Logist. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Justin B. Brown, Eli V. Olinick |
A Set Covering Approach for Selecting Preferred Systems to Support Mission Engineering. |
IEEE Syst. J. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Thibaud Godon, Baptiste Bauvin, Pascal Germain, Jacques Corbeil, Alexandre Drouin |
Invariant Causal Set Covering Machines. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Anupam Gupta 0001, Gregory Kehne, Roie Levin |
Set Covering with Our Eyes Wide Shut. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Haoming Shen, Ruiwei Jiang |
Chance-constrained set covering with Wasserstein ambiguity. |
Math. Program. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Saeed Saffari, Yahya Fathi |
Bi-criteria set covering problem with conflict constraints. |
Comput. Ind. Eng. |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero, Deborah Pareo |
A Surprisal-Based Greedy Heuristic for the Set Covering Problem. |
Algorithms |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Brooks Emerick, Myung Soon Song, Yun Lu 0003, Francis J. Vasko |
An Application of Machine Learning Tools to Predict the Number of Solutions for a Minimum Cardinality Set Covering Problem. |
OLA |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006 |
A Local Search-Based Approach for Set Covering. |
SOSA |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Babek Erdebilli, Selcen Gülsüm Aslan Özsahin |
Uncertainty management with an autonomous approach to fuzzy set-covering facility location models. |
J. Intell. Fuzzy Syst. |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Lakmali Weerasena, Aniekan Ebiefung, Anthony Skjellum |
Design of a heuristic algorithm for the generalized multi-objective set covering problem. |
Comput. Optim. Appl. |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Saeed Saffari, Yahya Fathi |
Set covering problem with conflict constraints. |
Comput. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Sicong Pan, Hao Hu, Hui Wei 0001 |
SCVP: Learning One-Shot View Planning via Set Covering for Unknown Object Reconstruction. |
IEEE Robotics Autom. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Torbjörn Larsson, Nils-Hassan Quttineh |
Column generation extensions of set covering greedy heuristics. |
Oper. Res. Lett. |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Helene Krieg, Tobias Seidel, Jan Schwientek, Karl-Heinz Küfer |
Solving continuous set covering problems by means of semi-infinite optimization. |
Math. Methods Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 544 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|