An ant-based framework for very strongly constrained problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2463, Issue , 2002, Pages 222-227

  Maniezzo, Vittorio ^a   Milandri, Matteo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; DATA WAREHOUSES; HEURISTIC ALGORITHMS;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL RESULTS; CONSTRAINED PROBLEM; LOGICAL DESIGN; META HEURISTICS; PROBLEM INSTANCES; REAL-WORLD PROBLEM; SET PARTITIONING PROBLEM;

INTEGER PROGRAMMING;

EID: 84974686620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45724-0_19     Document Type: Conference Paper

References (5)

1. A. Atamtürk, G.L. Nemhauser, and M.W.P. Savelsbergh. A combined lagrangian, linear programming and implication heuristic for large-scale set partitioning problems. Journal of Heuristics, 1:247-259, 1995.
2. P.C. Chu and J.E. Beasley. Constraint handling in genetic algorithms: the set partitoning problem. Journal of Heuristics, 4:323-357, 1998.
3. M. Golfarelli, V. Maniezzo, and S. Rizzi. Materialization of Fragmented Views in Multidimensional Databases. Technical Report TR-001-02, Scienze dell’Informazione, University of Bologna, 2002.
4. V. Maniezzo. Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS Journal on Computing, 11(4):358-369, 1999.
5. V. Maniezzo, A. Carbonaro, M. Golfarelli, and S. Rizzi. An ANTS Algorithm for Optimizing the Materialization of Fragmented Views in Data Warehouses: Preliminary Results. In Applications of Evolutionary Computing, volume 2037 of Lecture Notes in Computer Science, pages 80-89. Springer Verlag, 2001.