Switch to: Citations

Add references

You must login to add references.
  1. Random constraint satisfaction: Easy generation of hard (satisfiable) instances.Ke Xu, Frédéric Boussemart, Fred Hemery & Christophe Lecoutre - 2007 - Artificial Intelligence 171 (8-9):514-534.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Pareto optimization for subset selection with dynamic cost constraints.Vahid Roostapour, Aneta Neumann, Frank Neumann & Tobias Friedrich - 2022 - Artificial Intelligence 302 (C):103597.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms.Chao Qian, Yang Yu, Ke Tang, Xin Yao & Zhi-Hua Zhou - 2019 - Artificial Intelligence 275 (C):279-294.
    Download  
     
    Export citation  
     
    Bookmark   3 citations