Results 291 to 300 of about 167,714 (331)
Some of the next articles are maybe not open access.
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
Efficient global optimization for combinatorial problems
Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014Real-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 +5 more
openaire +1 more source
Artificial Intelligence Problems and Combinatorial Optimization
Cybernetics and Systems Analysis, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Stability in the Combinatorial Vector Optimization Problems
Automation and Remote Control, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emelichev, V. A. +2 more
openaire +1 more source
Linear Assignment Problems in Combinatorial Optimization
2017In 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
2013This 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 +2 more
openaire +1 more source
On Approximate Solutions for Combinatorial Optimization Problems
SIAM Journal on Discrete Mathematics, 1990The 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
Algorithmic extremal problems in combinatorial optimization
Journal of Algorithms, 1982Abstract An efficient approximation algorithm generator for the generalized maximum ψ-satisfiability problem is presented which produces an efficient approximation algorithm ψ-MAXMEAN∗ for each finite set ψ of relations. The algorithms ψ-MAXMEAN∗ are shown to be best-possible in the class of polynomial algorithms (if P ≠ NP), in both absolute and ...
openaire +2 more sources
Color constrained combinatorial optimization problems
Operations Research Letters, 1991Let \(E\) be a finite set and let \(c: E\to Z_ +\) be a non-negative integer cost function. Given subsets \(E_ 1,\dots,E_ K\subseteq E\) (colors) and \(\ell_ 1,\dots,\ell_ K\in Z\), find \(\min\sum_{e\in S}c(e)\) satisfying \(S\in{\mathcal S}\), \(| S\cap E_ k|=\ell_ k\), \(| S\cap\overline{E}_ k|=R-\ell_ k\), \(k=1,\dots,K\), where \(S\subseteq E\), \(
Horst W. Hamacher, Franz Rendl
openaire +1 more source
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