Results 21 to 30 of about 2,582,277 (310)
, 2020 23 páginasThe location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with large-scale instances that ...
Panadero, Javier +4 more
core +1 more source
, 2020 From brick-and-mortar stores to omnichannel retail, the efficient selection of products to be displayed on store tables, advertising brochures, or online front pages has become a critical issue.
Carmo Martins, Leandro do +4 more
core +1 more source
Algorithms for storytelling [PDF]
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 2006 We formulate a new data mining problem called storytelling as a generalization of redescription mining. In traditional redescription mining, we are given a set of objects and a collection of subsets defined over these objects. The goal is to view the set system as a vocabulary and identify two expressions in this vocabulary that induce the same set of ...
Deept Kumar +3 more
openaire +2 more sources
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride +3 more
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Approximation algorithms [PDF]
Proceedings of the National Academy of Sciences, 1997 Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business. To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems. It is not atypical to encounter models that capture 10
Schulz, Andreas S. +2 more
openaire +2 more sources
Development of an early alert model for pandemic situations in Germany
Scientific Reports, 2023 The COVID-19 pandemic has pointed out the need for new technical approaches to increase the preparedness of healthcare systems. One important measure is to develop innovative early warning systems.
Danqi Wang +9 more
doaj +1 more source
On Algorithmic Statistics for Space-Bounded Algorithms [PDF]
Theory of Computing Systems, 2017 accepted to CSR 2017 ...
openaire +3 more sources
Communications of the ACM, 2020 Seeking a new approach that goes beyond worst-case analysis.
Michael Mitzenmacher +1 more
openaire +3 more sources
The sparse awakens : streaming algorithms for matching size estimation in sparse graphs [PDF]
, 2017 Estimating the size of the maximum matching is a canonical problem in graph analysis, and one that has attracted extensive study over a range of different computational models.
Muthukrishnan, S. +3 more
core +1 more source