Automatic Construction of Parallel Portfolios via Explicit Instance Grouping
Not on the map. Why?
Abstract (arXiv)
Simultaneously utilizing several complementary solvers is a simple yet effective strategy for solving computationally hard problems. However, manually building such solver portfolios typically requires considerable domain knowledge and plenty of human effort. As an alternative, automatic construction of parallel portfolios (ACPP) aims at automatically building effective parallel portfolios based on a given problem instance set and a given rich design space. One promising way to solve the ACPP problem is to explicitly group the instances into different subsets and promote a component solver to handle each of them.This paper investigates solving ACPP from this perspective, and especially studies how to obtain a good instance grouping.The experimental results showed that the parallel portfolios constructed by the proposed method could achieve consistently superior performances to the ones constructed by the state-of-the-art ACPP methods,and could even rival sophisticated hand-designed parallel solvers.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 17 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 2; 2024: 1; 2025: 1; 2026: 2.
11 papers.
- 2022A Survey of Methods for Automated Algorithm Configurationcited by 30
- 2021Efficient Combinatorial Optimization for Word-level Adversarial Textual Attackcited by 17
- 2024LLMs for Cold-Start Cutting Plane Separator Configurationcited by 8
- 2022Reliable Robustness Evaluation via Automatically Constructed Attack Ensemblescited by 6
- 2021Effective and Imperceptible Adversarial Textual Attack via Multi-objectivizationcited by 5
- 2021Training Quantized Deep Neural Networks via Cooperative Coevolutioncited by 1
- 2026Beyond Average Performance: Dynamic Instance Clustering and Specialized Algorithm Design in LLM-Assisted Evolutionary Searchcited by 1
- 2023Memory efficient location recommendation through proximity-aware representationcited by 0
- 2023Divide-and-Conquer Strategy for Large-Scale Dynamic Bayesian Network Structure Learningcited by 0
- 2025Scalable Structure Learning of Bayesian Networks by Learning Algorithm Ensemblescited by 0
- 2026RASP-QAOA: Resource-Aware Per-Instance Selection for Exact QAOA Simulationcited by 0
- 2026RASP-QAOA: Resource-Aware Per-Instance Selection for Exact QAOA Simulation6 Aug 2026
- 2026Beyond Average Performance: Dynamic Instance Clustering and Specialized Algorithm Design in LLM-Assisted Evolutionary Search4 Aug 2026
- 2025Scalable Structure Learning of Bayesian Networks by Learning Algorithm Ensembles28 Jun 2025
- 2024LLMs for Cold-Start Cutting Plane Separator Configuration16 Dec 2024
- 2023Divide-and-Conquer Strategy for Large-Scale Dynamic Bayesian Network Structure Learning4 Dec 2023
- 2023Memory efficient location recommendation through proximity-aware representation10 Oct 2023
- 2022Reliable Robustness Evaluation via Automatically Constructed Attack Ensembles23 Nov 2022
- 2022A Survey of Methods for Automated Algorithm Configuration3 Feb 2022
- 2021Training Quantized Deep Neural Networks via Cooperative Coevolution23 Dec 2021
- 2021Effective and Imperceptible Adversarial Textual Attack via Multi-objectivization2 Nov 2021
- 2021Efficient Combinatorial Optimization for Word-level Adversarial Textual Attack6 Sep 2021