Results 31 to 40 of about 28,946 (263)
On some combinatorial problems in cographs [PDF]
International Journal of Advances in Engineering Sciences and Applied Mathematics, 2019 21 pages, 4 ...
Harshita Kona, N. Sadagopan
openaire +2 more sources
Educar em Revista, 2011 Neste trabalho apresentamos os dados de uma pesquisa que teve por objetivo verificar o desempenho de alunos do 6.° ao 9.° anos do Ensino Fundamental na resolução de oito problemas multiplicativos, envolvendo raciocínio combinatório. Os problemas diferiam
Leny R. M. Teixeira +3 more
doaj +1 more source
A Combinatorial Assignment Problem [PDF]
Nature, 1961 IN an establishment, there are v= nk officers, r departments and k types of jobs in each department. Each officer has to be assigned a job in each department such that in any department there are equal numbers of officers in different jobs and any two officers have common jobs in exactly λ departments.
openaire +1 more source
The Wisdom of the Crowd in Combinatorial Problems [PDF]
Cognitive Science, 2012 AbstractThe “wisdom of the crowd” phenomenon refers to the finding that the aggregate of a set of proposed solutions from a group of individuals performs better than the majority of individual solutions. Most often, wisdom of the crowd effects have been investigated for problems that require single numerical estimates. We investigate whether the effect
Sheng Kung Michael Yi +3 more
openaire +3 more sources
Solving Combinatorial Optimization Problems on Quantum Computers
Кібернетика та комп'ютерні технології, 2020 Introduction. Quantum computers provide several times faster solutions to several NP-hard combinatorial optimization problems in comparison with computing clusters.
Vyacheslav Korolyov +1 more
doaj +1 more source
Combinatorial reconstruction problems
Journal of Combinatorial Theory, Series B, 1989 A general technique for tackling reconstruction problems is presented and applied to some old and some new instances of such problems. In particular it is shown that every polygon wih \(m>8\) vertices in the plane is determined, up to isometry, by the set of isometry types of its vertex deleted subpolygons.
Noga Alon +3 more
openaire +1 more source
Pandora’s Problem with Combinatorial Cost
Mathematics of Operations Research, 2023 Pandora’s problem is a fundamental model in economics that studies optimal search strategies under costly inspection. In this paper, we initiate the study of Pandora’s problem with combinatorial costs, capturing applications where search cost is nonadditive. Weitzman’s celebrated algorithm (1979) demonstrates that for additive costs, the optimal search
Berger, Ben +3 more
openaire +3 more sources
On a problem in combinatorial geometry
Discrete Mathematics, 1982 Let \(f(S)\) be the ratio of the area of a largest (nondegenerate) triangle determined by the points of a finite set \(S\) to that of a smallest, and \(f(n)=\inf_sf(S)\), where the infimum is taken over all planar, noncollinear sets \(S\) of cardinality \(n\).
Paul Erdös +2 more
openaire +2 more sources
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem [PDF]
Yugoslav Journal of Operations Research, 2011 Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets.
Pop Petrica, Pop-Sitar Corina
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source