EasyLocal++

swMATH4104MaRDI QIDQ16291FDOQ16291

Author name not available (Why is that?)

Official website: http://satt.diegm.uniud.it/EasyLocal++/

Cited In (56)

• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• Metaheuristic Class Libraries
• Combining relational algebra, SQL, constraint modelling, and local search
• Hybrid metaheuristics for constrained portfolio selection problems
• Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
• Local search techniques for constrained portfolio selection problems
• Modeling and solving a real-life multi-skill shift design problem
• Local search and lower bounds for the patient admission scheduling problem
• Feature-based tuning of single-stage simulated annealing for examination timetabling
• A survey of search methodologies and automated system development for examination timetabling
• An effective hybrid algorithm for university course timetabling
• Title not available (Why is that?)
• The balanced academic curriculum problem revisited
• Contraint-based combinators for local search
• Metaheuristics ``In the large
• Title not available (Why is that?)
• Real-time solving of computationally hard problems using optimal algorithm portfolios
• Title not available (Why is that?)
• EOlib
• Hyperheuristics
• INCOP
• iOpt
• MALLBA
• ParaDisEO
• SALSA
• COMET
• BACP
• PPRN
• ECJ
• OPT4J
• race
• optalgtoolkit
• HotFrame
• json2run
• The minimum shift design problem
• MAFRA
• EasyAnalyzer
• Localizer++
• NILS
• DragonBreath
• Localizer
• PARPAP
• Metaheuristics for the portfolio selection problem
• Hybrid Local Search for Constrained Financial Portfolio Selection Problems
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• A software framework for fast prototyping of meta‐heuristics hybridization
• The generalized balanced academic curriculum problem with heterogeneous classes
• Neighborhood portfolio approach for local search applied to timetabling problems
• Maintaining longest paths incrementally
• emili
• Grid computing for parallel bioinspired algorithms
• The second international nurse rostering competition
• Maintaining longest paths incrementally
• Control abstractions for local search
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Title not available (Why is that?)

This page was built for software: EasyLocal++