|
|
|
|
|
Yuriy Shablya
Methods of combinatorial generation make it possible to develop algorithms for generating objects from a set of discrete structures with given parameters and properties. In this article, we demonstrate the possibilities of using the method based on AND/O...
ver más
|
|
|
|
|
|
|
|
|
|
|
Aphisak Witthayapraphakorn, Sasarose Jaijit and Peerayuth Charnsethikul
A novel approach was developed that combined LP-based row generation with optimization-based sorting to tackle computational challenges posed by budget allocation problems with combinatorial constraints. The proposed approach dynamically generated constr...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alexandr Kuznetsov, Mikolaj Karpinski, Ruslana Ziubina, Sergey Kandiy, Emanuele Frontoni, Oleksandr Peliukh, Olga Veselska and Ruslan Kozak
The problem of nonlinear substitution generation (S-boxes) is investigated in many related works in symmetric key cryptography. In particular, the strength of symmetric ciphers to linear cryptanalysis is directly related to the nonlinearity of substituti...
ver más
|
|
|
|
|
|
|
|
|
|
|
Shenquan Huang, Ya-Chih Tsai and Fuh-Der Chou
This paper considers the single-machine problem with job release times and flexible preventive maintenance activities to minimize total weighted tardiness, a complicated scheduling problem for which many algorithms have been proposed in the literature. H...
ver más
|
|
|
|
|
|
|
|
|
|
|
Vladimir Kruchinin, Yuriy Shablya, Dmitry Kruchinin and Victor Rulevskiy
The presented research is devoted to the problem of developing new combinatorial generation algorithms for combinations. In this paper, we develop a modification of Ruskey?s algorithm for unranking m-combinations of an n-set in co-lexicographic order. Th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Oscar Danilo Montoya, Luis Fernando Grisales-Noreña and Carlos Andres Ramos-Paja
The problem of optimal siting and dimensioning of photovoltaic (PV) generators in medium-voltage distribution networks is addressed in this research from the perspective of combinatorial optimization. The exact mixed-integer programming (MINLP) model is ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Antoine Genitrini and Martin Pépin
In the context of combinatorial sampling, the so-called ?unranking method? can be seen as a link between a total order over the objects and an effective way to construct an object of given rank. The most classical order used in this context is the lexico...
ver más
|
|
|
|
|
|
|
|
|
|
|
Thays A. Oliveira, Yuri B. Gabrich, Helena Ramalhinho, Miquel Oliver, Miri W. Cohen, Luiz S. Ochi, Serigne Gueye, Fábio Protti, Alysson A. Pinto, Diógenes V. M. Ferreira, Igor M. Coelho and Vitor N. Coelho
Cities are constantly transforming and, consequently, attracting efforts from researchers and opportunities to the industry. New transportation systems are being built in order to meet sustainability and efficiency criteria, as well as being adapted to t...
ver más
|
|
|
|
|
|
|
|
|
|
|
José de Jesús Rivero Oliva,Jesús Salomón Llanes,Antonio Torres Valle,Manuel Perdomo Ojeda
Pág. 56 - 61
O presente trabalho foi dedicado à avaliação de árvores de falhas mediante uma planilha EXCEL. A determinação dos Cortes Mínimos(CM) foi realizada formando todas as combinações possíveis dos eventos básicos que integram a árvore. O método impede que o cá...
ver más
|
|
|
|
|
|
|
|
|
|
|
Atif Shahzad and Nasser Mebarki
A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitio...
ver más
|
|
|
|
|
|