Tianwei Zhang | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/tianwei-zhang/Tianwei ZhangHugo Blox Builder (https://hugoblox.com)en-usWed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/team/tianwei-zhang/avatar_hu1281166089852635557.jpgTianwei Zhanghttps://ac.tuwien.ac.at/team/tianwei-zhang/Genetic Programming Hyper-Heuristic for the Dynamic Electric Dial-a-Ride Problemhttps://ac.tuwien.ac.at/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/genetic-programming-hyper-heuristic-for-the-dynamic-electric-dial-a-ride-problem/The 3-Decomposition Conjecture: A SAT-Based Approach with Specialized Propagatorshttps://ac.tuwien.ac.at/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-3-decomposition-conjecture-a-sat-based-approach-with-specialized-propagators/Compilation and Fast Model Counting beyond CNFhttps://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/compilation-and-fast-model-counting-beyond-cnf/Small unsatisfiable k-CNFs with bounded literal occurrencehttps://ac.tuwien.ac.at/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/small-unsatisfiable-k-cnfs-with-bounded-literal-occurrence/Searching for smallest universal graphs and tournaments with SAThttps://ac.tuwien.ac.at/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/searching-for-smallest-universal-graphs-and-tournaments-with-sat/