### A new formulation and solution of the sequencing problem: algorithm

J. Grabowski (1977)

Applicationes Mathematicae

Similarity:

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

J. Grabowski (1977)

Applicationes Mathematicae

Similarity:

Bošnjak, Ivica (1998)

Novi Sad Journal of Mathematics

Similarity:

M. M. Sysło (1974)

Applicationes Mathematicae

Similarity:

Peter Růžička, Juraj Wiedermann (1979)

Aplikace matematiky

Similarity:

Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal.

Nicolae Cîndea, Benoît Fabrèges, Frédéric de Gournay, Clair Poignard (2010)

ESAIM: Proceedings

Similarity:

Electroporation consists in increasing the permeability of a tissue by applying high voltage pulses. In this paper we discuss the question of optimal placement and optimal loading of electrodes such that electroporation holds only in a given open set of the domain. The electroporated set of the domain is where the norm of the electric field is above a given threshold value. We use a standard gradient algorithm to optimize the loading...

Jochen Harant, Ingo Schiermeyer (2006)

Discussiones Mathematicae Graph Theory

Similarity:

For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.

Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)

Discussiones Mathematicae Graph Theory

Similarity:

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.

Grün, Gabrielle Assunta (2001)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Marc Demange, Bernard Kouakou, Eric Soutif (2011)

The Yugoslav Journal of Operations Research

Similarity:

Harel, David, Koren, Yehuda (2004)

Journal of Graph Algorithms and Applications

Similarity:

Edward W. Packel (1986)

Aequationes mathematicae

Similarity:

B. Hoda Helmi, Adel T. Rahmani, Martin Pelikan (2014)

International Journal of Applied Mathematics and Computer Science

Similarity:

We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable...