Aggregation of networks
Agrégation des similarités : une solution oubliée
Le problème de l’agrégation des similarités signées est résolu à l’aide d’une version dérivant de l’algorithme booléen de Faure et Malgrange. La méthode s’applique à des similarités entières ou réelles, et permet l’énumération des solutions multiples. Elle nécessite une quantité de mémoire égale à trois fois la taille des données d’entrée.
Agrégation des similarités : une solution oubliée
The signed similarities aggregation problem is solved with a boolean method derived from the Faure and Malgrange algorithm. The method is adequate either for integer similarities or real similarites, and multiple solutions can be enumerated. It needs a space amount equal to three times the input data size.
Airline Seat Management With Round-Trip Requests
Airspace sectorization with constraints
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...
Airspace sectorization with constraints
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental...
Algèbre linéaire et cheminement dans un graphe
Algorithm 14. Initial solution to the zero-one integer linear programming problem
Algorithm. 44. MIMUN. Optimization of one-dimensional multimodal functions in the presence of noise
Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorithm 49. An algorithm for solving the machine sequencing problem
Algorithm 5. Solution of the transportation problem by bridges dual labeling method
Algorithm 51. Solution of linear programming problems in zero-one variables
Algorithm 66. An algorithm for solving the machine sequencing problem with parallel machines
Algorithm 69. Two distances between hypergraphs
Algorithm for turnpike policies in the dynamic lot size model
This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted that determine...
Algorithme d'approximation interne de problèmes de point de selle avec contraintes via l'optimisation
Algorithmes de plus courts chemins pour traiter des données floues
Algorithmes de poursuite pour la résolution de programmes (linéaires) en nombres entiers
Algorithmes de programmation convexe par linéarisation en format constant