Results 31 to 40 of about 1,967,671 (302)
Parameterized shifted combinatorial optimization [PDF]
Journal of Computer and System Sciences, 2017 Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well studied and diverse problems ranging from so-called vulnerability problems to sharing and partitioning problems.
Jakub Gajarský +3 more
openaire +2 more sources
Combinatorial ink-jet printing for ceramic discovery [PDF]
, 2006 PhDAn aspirating and dispensing printer established inside a robot gantry equipped with furnace and measurement table is used to prepare thick-film combinatorial libraries.
Wang, Jian
core +4 more sources
Optimal combinatorial electricity markets [PDF]
Web Intelligence and Agent Systems: An International Journal, 2008 The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage and meet their energy needs. To this end, this paper develops a new model for electricity retail where end-use customers choose their supplier from competing electricity ...
Penya, Y.K., Jennings, N. R.
openaire +4 more sources
Recent Evolutionary Algorithm Variants for Combinatorial Optimization Problem
Applications of Modelling and Simulation, 2023 The evolutionary algorithm has been extensively used to solve a range of combinatorial optimization problems. The adaptability of evolutionary algorithm mechanisms provides diverse approaches to handle combinatorial optimization challenges.
Anniza Hamdan +4 more
doaj
A Random-Key optimizer for combinatorial optimization [PDF]
Journal of Heuristics54 pages, 16 figures, 8 ...
Antonio Augusto Chaves +6 more
openaire +3 more sources
Differentially Private Combinatorial Optimization [PDF]
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010 Consider the following problem: given a metric space, some of whose points are ``clients,'' select a set of at most $k$ facility locations to minimize the average distance from the clients to their nearest facility. This is just the well-studied $k$-median problem, for which many approximation algorithms and hardness results are known.
Anupam Gupta 0001 +4 more
openaire +6 more sources
Multiobjective combinatorial optimization problems: social, keywords, and journal maps
, 2022 Multiobjective combinatorial optimization problems appear in a wide range of applications including operations research/management, engineering, biological sciences, and computer science.
Siamak Talatahari +7 more
core +1 more source
Mathematical modeling of finite topologies
Karpatsʹkì Matematičnì Publìkacìï, 2020 Integer programming is a tool for solving some combinatorial optimization problems. In this paper, we deal with combinatorial optimization problems on finite topologies.
S.E. Monabbati, H. Torabi
doaj +1 more source
Decentralized Combinatorial Optimization [PDF]
, 2020 Combinatorial optimization is a widely-studied class of computational problems with many theoretical and real-world applications. Optimization problems are typically tackled using hardware and software controlled by the user. Optimization can be competitive where problems are solved by competing agents in isolation, or by groups sharing hardware and ...
openaire +1 more source
Bee Colony Optimization - part II: The application survey [PDF]
Yugoslav Journal of Operations Research, 2015 Bee Colony Optimization (BCO) is a meta-heuristic method based on foraging habits of honeybees. This technique was motivated by the analogy found between the natural behavior of bees searching for food and the behavior of optimization algorithms
Teodorović Dušan +2 more
doaj +1 more source