Partitioning procedures for solving mixed-variables programming problems.
J.F. BENDERS (1962/63)
Numerische Mathematik
Similarity:
J.F. BENDERS (1962/63)
Numerische Mathematik
Similarity:
C. Johnson (1976)
Publications mathématiques et informatique de Rennes
Similarity:
Huy Trandac, Philippe Baptiste, Vu Duong (2010)
RAIRO - Operations Research
Similarity:
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....
Abdelwaheb Rebaï, Jean-Marc Martel (2010)
RAIRO - Operations Research
Similarity:
In this work we propose a ranking procedure. This procedure uses an ordinal information about the criterion weights and a non-cardinal or mixed information for the potential actions evaluation. The advantage of this procedure is that it uses the linear programming software packages to compute the intervals of relative proximities from where the rankings are obtained.