Cœur et nucléolus des jeux de recouvrement
Coeur et nucléolus des jeux de recouvrement
A cooperative game is defined as a set of players and a cost function. The distribution of the whole cost between the players can be done using the core concept, that is the set of all undominated cost allocations which prevent players from grouping. In this paper we study a game whose cost function comes from the optimal solution of a linear integer covering problem. We give necessary and sufficient conditions for the core to be nonempty and characterize its allocations using linear programming...
Coevolutionary genetic algorithms for establishing Nash equilibrium in symmetric Cournot games.
Coloration de graphes : fondements et applications
Les modèles classiques de coloration doivent leur notoriété en grande partie à leurs applications à des problèmes de type emploi du temps ; nous présentons les concepts de base des colorations ainsi qu’une série de variations et de généralisations motivées par divers problèmes d’ordonnancement dont les élaborations d’horaires scolaires. Quelques algorithmes exacts et heuristiques seront présentés et nous esquisserons des méthodes basées sur la recherche Tabou pour trouver des solutions approchées...
Coloration de graphes : fondements et applications
The classical colouring models are well known thanks in large part to their applications to scheduling type problems; we describe the basic concepts of colourings together with a number of variations and generalisations arising from scheduling problems such as the creation of school schedules. Some exact and heuristic algorithms will be presented, and we will sketch solution methods based on tabu search to find approximate solutions to large problems. Finally we will also mention the use...
Colored decision process Petri nets: modeling, analysis and stability
In this paper we introduce a new modeling paradigm for developing a decision process representation called the Colored Decision Process Petri Net (CDPPN). It extends the Colored Petri Net (CPN) theoretic approach including Markov decision processes. CPNs are used for process representation taking advantage of the formal semantic and the graphical display. A Markov decision process is utilized as a tool for trajectory planning via a utility function. The main point of the CDPPN is its ability to...
Column generation and the airline crew pairing problem.
Column-generation in integer linear programming
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this approach...
Column-Generation in Integer Linear Programming
We present an exact method for integer linear programming problems that combines branch and bound with column generation at each node of the search tree. For the case of models involving binary column vectors only, we propose the use of so-called geometrical cuts to be added to the subproblem in order to eliminate previously generated columns. This scheme could be applied to general integer problems without specific structure. We report computational results on a successful application of this...
Combination of anti-optimization and fuzzy-set-based analyses for structural optimization under uncertainty.
Combination of mobile agent and evolutionary algorithm to optimize the client transport services
This paper presents a migration strategy for a set of mobile agents (MAs) in order to satisfy customers' requests in a transport network, through a multimodal information system. In this context, we propose an optimization solution which operates on two levels. The first one aims to constitute a set of MAs building their routes, called Workplans. At this level, Workplans must incorporate all nodes, representing information providers in the multimodal network, in order to explore it completely....
Combination trading with limit orders.
Combinatorial algorithms for computing column space bases that have sparse inverses.
Combinatorial identities from the spectral theory of quantum graphs.
Combinatorial Methods for Solving Problems of Optimal Portional Resource Distribution
Combinatorial optimization in DNA mapping — A computational thread of the simplified partial digest problem
In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O()-time algorithm is given, where is a number of restriction...
Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
In the paper, the problem of the genome mapping of DNA molecules, is presented. In particular, the new approach — the Simplified Partial Digest Problem (SPDP), is analyzed. This approach, although easy in laboratory implementation and robust with respect to measurement errors, when formulated in terms of a combinatorial search problem, is proved to be strongly NP-hard for the general error-free case. For a subproblem of the SPDP, a simple O(nlogn)-time algorithm is given, where n is a number of...
Combinatorial optimization in production and logistics systems
Combinatorial properties of Fourier-Motzkin elimination.
Combined relaxation methods for variational inequality problems over products sets.