Results 111 to 120 of about 28,166 (165)
Some of the next articles are maybe not open access.
On Certain Combinatorial Problems
American Journal of Physics, 1962In a recent paper, McLachlan and Chamberlain have proposed and solved the following problem: To find the number W(n,m,M) of ways of distributing m indistinguishable objects into n boxes with no more than M in each box. We present in this paper two additional methods for solving this problem and give solutions to four problems proposed but not solved by
Rosenstock, H. B., Maradudin, A. A.
openaire +1 more source
Reducibility Among Combinatorial Problems
1972Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held. These experiences made me aware that seemingly simple discrete optimization problems could hold the seeds of combinatorial explosions.
openaire +2 more sources
On A Combinatorial Problem III
Canadian Mathematical Bulletin, 1964A family of sets {Aα} is said by Miller [3] to have property B if there exists a set S which meets all the sets Aα and contains none of them. Property B has been extensively studied in several recent papers (see the references in [2] and the last chapter of P. Erdös and A. Hajnal, On chromatic number of graphs and set systems, Acta. Math. Acad.
openaire +2 more sources
Combinatorial Optimization Problems
1999Combinatorial optimization problems possess a discrete special structure, such that it is very difficult to develop general purpose test problems, as well as general purpose software for solving them. For the exact solution of these problems, usually an equivalent integer programming formulation is provided to an IP solver, that uses branch and bound ...
Christodoulos A. Floudas +8 more
openaire +1 more source
Proteomics Facing the Combinatorial Problem
2009A large number of scoring functions for ranking peptide matches to observed MS/MS spectra have been discussed in the literature. In contrast to scoring functions, search strategies have received less attention, and an accurate description of search algorithms is limited.
Rune, Matthiesen, António, Amorim
openaire +2 more sources
Combinatorial Optimization Problems
2014We consider combinatorial optimization problems (COP), i.e., finding extrema of an objective function on a combinatorial space. Many various important applied and theoretical problems of different degree of complexity can be presented as problems in graph theory.
openaire +1 more source
Integrative oncology: Addressing the global challenges of cancer prevention and treatment
Ca-A Cancer Journal for Clinicians, 2022Jun J Mao,, Msce +2 more
exaly
Combinatorial Haplotyping Problems
2015This chapter addresses the haplotyping problem for both a single individual and a set of individuals (a population). In the former case the input is haplotype data inconsistent with the existence of exactly two parents for an individual. This inconsistency is due to experimental errors and/or missing data.
openaire +1 more source