timetabling problem
A mathematical programming model for high school timetabling problem
... del Timetabling; prueba de ello son trabajos realizados meses más tarde en Dinamarca, en los cuales se utilizó el sistema Lectio, un software Danés que es usado por el 95 % de las escuelas de es- te país para ...
25
Application of Ant Colony Optimization to course timetabling problem
... De esta forma el problema se puede formular como la programación de los horarios de clase definiendo la hora y el salón para cada evento de tal forma que cumpliendo las restricciones dur[r] ...
6
A bi objective model for the integrated frequency timetabling problem
... this problem two objectives like, the cost (fixed and variable), which are to be minimized by the urban transportation enterprise and the other objective is to maximize synchronizations, which are a proxy measure ...
11
Examination timetabling automation using hybrid meta-heuristics
... amination timetabling problem using exact method approaches, can only be done for small size ...Real problem instances found in practice, are usually of large size, making the use of exact methods ...
71
El problema de timetabling para colegios chilenos. Solución mediante algoritmos genéticos
... school timetabling problem was developed. To solve this problem, the Lingo software was used in small-sized instances, and a metaheuristic method, a genethic algorithm was designed to solve real ...
70
A hierarchical multiobjective problem for green logistics
... this problem is proposed where the leader minimizes its manufacturing costs and distribution costs between plants and warehouses while the follower minimizes inventory costs and transportation costs from ...
59
On a non linear elliptic problem
... and Browder, F., Strongly Nonlinear Elliptic Boundary Value Prob- lems, Ann.[r] ...
7
On Problem-Oriented Kernel Refining
... The algorithms involved in the empirical comparison with POKER are the following: !rst, RRSVM consists in selecting at random the kernels to be included instead of using the heuristic described in Section 3. This method ...
16
UNA METAHEURISTICA PARA LA RESOLUCION DEL MACHINE REASSIGNMENT PROBLEM
... En base a esto se aprecia, que si bien el algoritmo con modelo MIP pudo obtener resultados positivos en las instancias del conjunto A, sólo pudo obtener resultados mejores que ROADEF en [r] ...
101
Problem PRIMES pripada klasi PTIME
... broj n, oˇcito broj b ne moˇze biti ve´ci od log n. To znaˇci da se problem svodi na pitanje da li za 2 ≤ b ≤ log n postoji a ≥ 2 takav da n = a b . Lako je vidjeti da vrijedi: prirodan broj n je savrˇsena ...
62
The N01 matrix completion problem
... 0 -matrix with all specified off-diagonal entries negative, whose associated graph is 1-chordal with two maximal cliques, one of them with two vertices.. Let A be a combinatorially symme[r] ...
14
Problem Understanding through Landscape Theory
... In the case of the elementary functions defined over binary strings, the functions with higher order are more rugged than the ones with lower order. The order-1 elementary landscapes are the smoothest landscapes and, in ...
8
Beyond the classical Stefan problem
... Stefan problem was the need to mathematically formulate and describe observed natural physical phenomena, such as the melting, solidification or evapo- ration of a ...Stefan problem has been studied and ...
182
The unsplittable stable marriage problem
... Abstract. The Gale-Shapley “propose/reject” algorithm is a well- known procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable ...
11
Paralelni algoritmi za problem grupiranja podataka
... Slanje poruka moˇze se odvijati na dva osnovna naˇcina: od procesora do procesora ili ko- lektivno slanje. Poruke koje se ˇsalju od procesora do procesora su poruke koje su vidljive samo procesoru koji ˇsalje i procesoru ...
70
Problem Solving C++ CH 1
... List the two main phases of the program design process. Explain the importance of the problem-solving phase[r] ...
58
Robust optimization in production planning problem
... Expression (6.2.1) represents the objective function of the problem, which aims to maximize the revenues of the Division. The group of constraints (6.2.2) corresponds to the proximity limitations, as it is not ...
125
Graph Isomorphism Problem in Databases
... • Model Gram – model, kde jsou data organizována jako graf. Analogicky má hrana pojmenování, které reprezentuje vztah mezi typy[r] ...
47
Methodology to solve a computer problem
... We stated above that Python supports the object-oriented programming paradigm. This means that Python considers data to be the focal point of the problem-solving process. In Python, as well as in any other ...
12