Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
A Racing Algorithm for Configuring Metaheuristics
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
A study of the lot-sizing polytope
Mathematical Programming: Series A and B
Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Journal of Global Optimization
Experimental Research in Evolutionary Computation: The New Experimentalism (Natural Computing Series)
Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization
SIAM Journal on Optimization
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Operations Research
Boosting Verification by Automatic Tuning of Decision Procedures
FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
An experimental investigation of model-based parameter optimisation: SPO and beyond
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Automatic algorithm configuration based on local search
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Adaptive problem-solving for large-scale scheduling problems: a case study
Journal of Artificial Intelligence Research
SATenstein: automatically building local search SAT solvers from components
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
Connections in networks: a hybrid approach
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
A gender-based genetic algorithm for the automatic configuration of algorithms
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Time-bounded sequential parameter optimization
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Automatic configuration of state-of-the-art multi-objective optimizers using the TP+PLS framework
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A probing algorithm for MINLP with failure prediction by SVM
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Communications of the ACM
Sequential model-based optimization for general algorithm configuration
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
HAL: a framework for the automated analysis and design of high-performance algorithms
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Monotone branch-and-bound search for restricted combinatorial auctions
Proceedings of the 13th ACM Conference on Electronic Commerce
Bounding, filtering and diversification in CP-based local branching
Journal of Heuristics
Parallel algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Quantifying homogeneity of instance sets for algorithm configuration
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Automatically configuring algorithms for scaling performance
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Competitive intelligence for SMEs: a web-based decision support system
International Journal of Business Information Systems
Ordered racing protocols for automatically configuring algorithms for scaling performance
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Automatic (offline) configuration of algorithms
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
INFORMS Journal on Computing
Bayesian optimization in high dimensions via random embeddings
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Algorithm runtime prediction: Methods & evaluation
Artificial Intelligence
| Hi-index | 0.02 |
State-of-the-art solvers for mixed integer programming (MIP) problems are highly parameterized, and finding parameter settings that achieve high performance for specific types of MIP instances is challenging. We study the application of an automated algorithm configuration procedure to different MIP solvers, instance types and optimization objectives. We show that this fully-automated process yields substantial improvements to the performance of three MIP solvers: Cplex, Gurobi, and lpsolve. Although our method can be used “out of the box” without any domain knowledge specific to MIP, we show that it outperforms the Cplex special-purpose automated tuning tool.