1,721,462 research outputs found
Quartiers sud : Bonneveine, St Giniez, La Plage - P. TOTH
No full text« La qualité environnementale via les aménités de Bonneveine, La Plage et Saint Giniez : des quartiers sud privilégiés et convoités. Enquête sur les perceptions et pratiques des habitants des quartiers étudiés au sein de trois ensembles résidentiels fermés » P. TOTH, sous la dir. d'E. Dorier, M2 Géographie, 2012 Mots-clés: Quartiers sud de Marseille, qualité environnementale/inégalité environnementale, qualité de vie, indicateurs de mesure de la qualité de vie, aménités, centralités de loisi..
Quartiers sud : Bonneveine, St Giniez, La Plage - P. TOTH
No full text« La qualité environnementale via les aménités de Bonneveine, La Plage et Saint Giniez : des quartiers sud privilégiés et convoités. Enquête sur les perceptions et pratiques des habitants des quartiers étudiés au sein de trois ensembles résidentiels fermés » P. TOTH, sous la dir. d'E. Dorier, M2 Géographie, 2012 Mots-clés: Quartiers sud de Marseille, qualité environnementale/inégalité environnementale, qualité de vie, indicateurs de mesure de la qualité de vie, aménités, centralités de loisi..
A Set-Covering Based Heuristic Approach for Bin-Packing Problems
No full textSeveral combinatorial optimization problems can be formulated as large set-covering problems. In this work, we use the set-covering formulation to obtain a general heuristic algorithm for this type of problem, and describe our implementation of the algorithm for solving two variants of the well-known (one-dimensional) bin-packing problem: the two-constraint bin-packing problem and the basic version of the two-dimensional bin-packing problem, where the objects cannot be rotated and no additional requirements are imposed. In our approach, both the “column-generation” and the “column-optimization” phases are heuristically performed. In particular, in the first phase, we do not generate the entire set of columns, but only a small subset of it, by using greedy procedures and fast constructive heuristic algorithms from the literature. In the second phase, we solve the associated set-covering instance by means of a Lagrangian-based heuristic algorithm. Extensive computational results on test instances from the literature show that, for the two considered problems, this approach is competitive, with respect to both the quality of the solution and the computing time, with the best heuristic and metaheuristic algorithms proposed so far
Algorithms and Codes for Dense Assignment Problems: the State of the Art
Full text linkThe paper considers the classic linear assignment problem witha min-sum objective function, and the most efficient and easily available codes for its solution.We first give a survey describing the different approaches in theliterature, presenting their implementations, and pointing out similarities and differences.Then we select eight codes and we introduce a wide set of dense instances containing both randomly generated and benchmark problems.Finally we discuss the results of extensive computational experiments obtained by solving the above instances with the eight codes, both on a workstation with Unix operating system and on a personal computer running under Windows 95
- …
