Results 231 to 240 of about 17,512 (264)
Some of the next articles are maybe not open access.
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
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
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
Competitive Model for Combinatorial Optimization Problems
200710.1007/978-3-540-69226-3_8 ; Studies in Computational Intelligence ; 53 ; 117 ...
Tang, H., Tan, K.C., Yi, Z.
openaire +3 more sources
An Additive Bounding Procedure for Combinatorial Optimization Problems
Operations Research, 1989We know that the effectiveness of the branch-and-bound algorithms proposed for the solution of combinatorial optimization problems greatly depends on the tightness of the available bounds. In this paper, we consider optimization problems with a linear objective function.
Fischetti Matteo, Toth Paolo
openaire +2 more sources
Metaheuristic algorithms for combinatorial optimization problems
4OR, 2005We present the main results in the author’s Ph.D. thesis (Iori 2004), defended at the University of Bologna in April 2004 and supervised by S. Martello. The thesis is written in English and is available from the author upon request. It proposes exact and metaheuristic algorithms for solving some relevant combinatorial optimization problems, with ...
openaire +2 more sources
Decomposability Conditions of Combinatorial Optimization Problems
2015Combinatorial Optimization Problems COP are generally complex and difficult to solve as a single monolithic problem. Thus, the process to solve the main initial COP may pass through solving intermediate problems and then combining the obtained partial solutions to find initial problem's global solutions.
Marouene Chaieb +2 more
openaire +1 more source
Preface: Quadratic combinatorial optimization problems
Discrete Optimization, 2022Abraham P. Punnen, Renata Sotirov
openaire +1 more source
Combinatorial Optimization Problems with Conflict Graphs. [PDF]
, 2009 Conflict graphs impose disjunctive constraints for pairs of jobs, items, edges or other objects in a combinatorial optimization problem. Equivalently, the feasible domain of the considered problem is restricted to stable sets in the given conflict graph.
Darmann, A. +3 more
openaire +1 more source
Algorithms for Bicriteria Combinatorial Optimization Problems
1989In recent years, many types of interactive optimization methods have been developed in order to support multicriteria decision makings (see the book by Sawaragi, Nakayama and Tanino, 1985 and Wierzbicki and Lewandowski, 1987). Given a feasible decision set X ⊆ R n, and p objective functions, f l, f 2,.,f p (all are assumed to be minimization for ...
openaire +3 more sources