On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem von Li, Chu-Min, Jiang, Hua, Manyà, Felip

Volltext

Theory and Applications of Satisfiability Testing - SAT 2021: 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings von Li, Chu-Min, Manyà, Felip

Volltext

Integrating multi-armed bandit with local search for MaxSAT von Zheng, Jiongzhi, He, Kun, Zhou, Jianrong, Jin, Yan, Li, Chu-Min, Manyà, Felip

Volltext

Clause vivification by unit propagation in CDCL SAT solvers von Li, Chu-Min, Xiao, Fan, Luo, Mao, Manyà, Felip, Lü, Zhipeng, Li, Yu

Volltext

Negative Learning Ant Colony Optimization for MaxSAT von Nurcahyadi, Teddy, Blum, Christian, Manyà, Felip

Volltext

MaxSAT resolution for regular propositional logic von Coll, Jordi, Li, Chu-Min, Manyà, Felip, Yangin, Elifnaz

Volltext

New complexity results for Łukasiewicz logic von Bofill, Miquel, Manyà, Felip, Vidal, Amanda, Villaret, Mateu

Volltext

A new upper bound for the maximum weight clique problem von Li, Chu-Min, Liu, Yanli, Jiang, Hua, Manyà, Felip, Li, Yu

Volltext

Theory and Applications of Satisfiability Testing – SAT 2021: 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings

Volltext

Incomplete MaxSAT approaches for combinatorial testing von Ansótegui, Carlos, Manyà, Felip, Ojeda, Jesus, Salvia, Josep M., Torres, Eduard

Volltext

Clausal Forms in MaxSAT and MinSAT von Li, Chu Min, Manyà, Felip, Soler, Joan Ramon, Vidal, Amanda

Volltext

Solving longest common subsequence problems via a transformation to the maximum clique problem von Blum, Christian, Djukanovic, Marko, Santini, Alberto, Jiang, Hua, Li, Chu-Min, Manyà, Felip, Raidl, Günter R.

Volltext

Parallel Bounded Search for the Maximum Clique Problem von Jiang, Hua, Bai, Ke, Liu, Hai-Jiao, Li, Chu-Min, Manyà, Felip, Fu, Zhang-Hua

Volltext

A new upper bound for the maximum weight clique problem von Li, Chu-Min, Liu, Yanli, Jiang, Hua, Manyà, Felip, Li, Yu

Volltext

Resolution for Max-SAT von Bonet, María Luisa, Levy, Jordi, Manyà, Felip

Volltext

Clause tableaux for maximum and minimum satisfiability von Argelich, Josep, Li, Chu Min, Manyà, Felip, Soler, Joan Ramon

Volltext

A resolution calculus for MinSAT von Li, Chu-Min, Xiao, Fan, Manyà, Felip

Volltext

Boosting branch-and-bound MaxSAT solvers with clause learning von Li, Chu-Min, Xu, Zhenxing, Coll, Jordi, Manyà, Felip, Habet, Djamal, He, Kun

Volltext

A branching heuristic for SAT solvers based on complete implication graphs von Xiao, Fan, Li, Chu-Min, Luo, Mao, Manyà, Felip, Lü, Zhipeng, Li, Yu

Volltext

Modeling energy consumption in automated vacuum waste collection systems von Fernández, Cèsar, Manyà, Felip, Mateu, Carles, Sole-Mauri, Francina

Volltext