MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
type: Item
instance of: scholarly article
title: MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
zbMATH Open document ID: 1458.90641
author: Tommaso Adamo
author: Gianpaolo Ghiani
author: A. Grieco
author: Emanuela Guerriero
author: Emanuele Manni
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6901417
zbMATH Keywords: mixed integer programming
zbMATH Keywords: neighborhood search
zbMATH Keywords: semantic features
describes a project that uses: COMET
describes a project that uses: Paramils
describes a project that uses: TSPLIB
describes a project that uses: AMPL
describes a project that uses: irace
describes a project that uses: GAMS
describes a project that uses: FEASPUMP
describes a project that uses: LocalSolver
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2017.01.021
OpenAlex ID: W2587562419
cites work: Improving the feasibility pump
cites work: Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem
cites work: Kernel search: a new heuristic framework for portfolio selection
cites work: LocalSolver 1.x: A black-box local-search solver for 0-1 programming
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: Tuning metaheuristics. A machine learning Perspective
cites work: Exploring Hyper-heuristic Methodologies with Genetic Programming
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Q3783827
cites work: The feasibility pump
cites work: Local branching
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Feasibility pump 2.0
cites work: Model-based automatic neighborhood design by unsupervised learning
cites work: Kernel search: an application to the index tracking problem
cites work: Variable neighborhood search and local branching
cites work: Bounding, filtering and diversification in CP-based local branching
cites work: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Constraint-based very large-scale neighborhood search
cites work: GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: Measuring instance difficulty for combinatorial optimization problems
cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
cites work: A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
cites work: Vehicle Routing
DOI: 10.1016/J.COR.2017.01.021
description: scientific article; zbMATH DE number 6901417