Lower bounds to the graph partitioning problem through generalized linear programming and network flows
M. Minoux, E. Pinson (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Minoux, E. Pinson (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Gianfranco d'Atri (1978)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
M. Minoux, J. Y. Serreault (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
William W. Agresti (1983)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
J. Carlier, P. Villon (1990)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Evripidis Bampis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Michael M. Kostreva, Włodzimierz Ogryczak (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
P. Richard, C. Proust (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Huy Trandac, Philippe Baptiste, Vu Duong (2005)
RAIRO - Operations Research - Recherche Opérationnelle
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....
Petrica Pop, Corina Pop Sitar (2011)
The Yugoslav Journal of Operations Research
Similarity: