Results 221 to 230 of about 17,512 (264)

An Immunological Approach to Combinatorial Optimization Problems

2002
In this work we use a simplified model of the immune system to explore the problem solving feature. We consider only two immunological entities, antigens and antibodies, two parameters, and simple immune operators. The experimental results shows how a simple randomized search algorithm coupled with a mechanism for adaptive recognition of hardest ...
CUTELLO, Vincenzo, NICOSIA, GIUSEPPE
openaire   +2 more sources

Combinatorial optimization problems in self-assembly

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02, 2002
Self-assembly is the ubiquitous process by which simple objects autonomously assemble into intricate complexes. It has been suggested that intricate self-assembly processes will ultimately be used in circuit fabrication, nano-robotics, DNA computation, and amorphous computing.
Leonard M. Adleman, Qi Cheng 0001, Ashish Goel, Ming-Deh A. Huang, David Kempe 0001, Pablo Moisset de Espanés, Paul W. K. Rothemund   +6 more
openaire   +1 more source

Combinatorial Optimization Problems

1999
Combinatorial 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, Pãnos M. Pardalos, Claire S. Adjiman, William R. Esposito, Zeynep H. Gümüş, Stephen T. Harding, John L. Klepeis, Clifford A. Meyer, Carl A. Schweiger   +8 more
openaire   +1 more source

Metaheuristics for dynamic combinatorial optimization problems

IMA Journal of Management Mathematics, 2012
Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task.
Yang, Shengxiang, Jiang, Y., Nguyen, T. T.   +2 more
openaire   +2 more sources

Efficient global optimization for combinatorial problems

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014
Real-world optimization problems may require time consuming and expensive measurements or simulations. Recently, the application of surrogate model-based approaches was extended from continuous to combinatorial spaces. This extension is based on the utilization of suitable distance measures such as Hamming or Swap Distance.
Martin Zaefferer, Jörg Stork, Martina Friese, Andreas Fischbach, Boris Naujoks, Thomas Bartz-Beielstein   +5 more
openaire   +1 more source

Artificial Intelligence Problems and Combinatorial Optimization

Cybernetics and Systems Analysis, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Stability in the Combinatorial Vector Optimization Problems

Automation and Remote Control, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emelichev, V. A., Kuz'min, K. G., Leonovich, A. M.   +2 more
openaire   +1 more source

Linear Assignment Problems in Combinatorial Optimization

2017
In this chapter we introduce the notion of a “pattern” in the Linear Assignment Problem and show that patterns may be useful to create new insights and approaches for many combinatorial optimization problems defined on a rectangular input matrix. We define a pattern as a specific collection of cells in the rectangular matrix reflecting the structure of
Goldengorin, Boris, Krushinsky, Dmitry
openaire   +2 more sources

Recoverable Robust Combinatorial Optimization Problems

2013
This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Busing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide ...
Adam Kasperski, Adam Kurpisz, Pawel Zielinski 0001   +2 more
openaire   +1 more source

On Approximate Solutions for Combinatorial Optimization Problems

SIAM Journal on Discrete Mathematics, 1990
The usefulness of a special kind of approximability-preserving transformations (called continuous reductions) among combinatorial optimization problems is demonstrated. One common measure for the approximability of an optimization problem is its best performance ratio.
openaire   +1 more source