Results 41 to 50 of about 4,919,639 (299)
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
On the Landscape of Combinatorial Optimization Problems [PDF]
IEEE Transactions on Evolutionary Computation, 2014 This paper carries out a comparison of the fitness landscape for four classic optimization problems: Max-Sat, graph-coloring, traveling salesman, and quadratic assignment. We have focused on two types of properties, local average properties of the landscape, and properties of the local optima.
Tayarani Najaran, Mohammad +1 more
openaire +3 more sources
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 +4 more sources
Approximating Incremental Combinatorial Optimization Problems [PDF]
, 2017 We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps.
Unda, Francisco, Goemans, Michel X.
core +1 more source
Approximating incremental combinatorial optimization problems [PDF]
, 2018 We consider incremental combinatorial optimization problems, in which a solution is constructed incrementally over time, and the goal is to optimize not the value of the final solution but the average value over all timesteps.
Unda, Francisco Tomas, Goemans, Michel X
core +1 more source
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
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 +3 more sources
Evolutionary computation applied to combinatorial optimisation problems [PDF]
, 2007 This thesis addresses the issues associated with conventional genetic algorithms (GA) when applied to hard optimisation problems. In particular it examines the problem of selecting and implementing appropriate genetic operators in order to meet the ...
Mitchell, George G.
core +2 more sources
On a combinatorial problem in geometry
Discrete Mathematics, 1975 AbstractDenote by g(n) the cardinality of a minimal subset C of an n × n square array of lattice points which does not contain the vertices of a square with sides parallel to the axes, but which is such that the addition of any new point to C forces the appearance of such a square. It is proved that g(n) < nα for some α < 2.
Harvey L. Abbott, Denis Hanson
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 +4 more sources