Capping methods for the automatic configuration of optimization algorithms
From MaRDI portal
Publication:2669790
Recommendations
- Model-based algorithm configuration with adaptive capping and prior distributions
- Paramils: an automatic algorithm configuration framework
- scientific article; zbMATH DE number 5829047
- Effect of transformations of numerical parameters in automatic algorithm configuration
- Automatically improving the anytime behaviour of optimisation algorithms
Cites work
- A guide to graph colouring. Algorithms and applications
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Ant colony optimization.
- Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
- Automatically improving the anytime behaviour of optimisation algorithms
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- BPPLIB: a library for bin packing and cutting stock problems
- Combinatorial auctions: a survey
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Exact solution of the two-dimensional finite bin packing problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Hybrid evolutionary algorithms for graph coloring
- Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. 7th international conference, CPAIOR 2010, Bologna, Italy, June 14--18, 2010. Proceedings
- Iterated tabu search for the unconstrained binary quadratic optimization problem
- Multiple Comparisons Among Means
- Paramils: an automatic algorithm configuration framework
- Path relinking for unconstrained binary quadratic programming
- Revisiting simulated annealing: a component-based analysis
- SATenstein: automatically building local search SAT solvers from components
- SCIP: solving constraint integer programs
- Stochastic local search. Foundations and applications.
- The unconstrained binary quadratic programming problem: a survey
- TSpack: A unified tabu search code for multi-dimensional bin packing problems
- Tuning metaheuristics. A machine learning Perspective
- Two-Dimensional Finite Bin-Packing Algorithms
Cited in
(10)- Effect of transformations of numerical parameters in automatic algorithm configuration
- Efficient benchmarking of algorithm configurators via model-based surrogates
- Model-based algorithm configuration with adaptive capping and prior distributions
- Automatically improving the anytime behaviour of optimisation algorithms
- MADS/F-Race: mesh adaptive direct search meets F-Race
- Paramils: an automatic algorithm configuration framework
- Pitfalls and best practices in algorithm configuration
- Using Automated Algorithm Configuration for Parameter Control
- A method for the automated configuration of anytime portfolios of algorithms
- Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
Describes a project that uses
Uses Software
This page was built for publication: Capping methods for the automatic configuration of optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669790)
