Parametric tabu-search for mixed integer programs

DOI10.1016/j.cor.2005.07.009zbMath1086.90061OpenAlexW2119293537MaRDI QIDQ2489300

Fred Glover

Publication date: 16 May 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.07.009

zbMATH Keywords

metaheuristicstabu searchmixed integer programmingadaptive memory

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints ⋮ Multipath adaptive tabu search for a vehicle control problem ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs ⋮ Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization ⋮ Design of PI controller for voltage controller of four-phase interleaved boost converter using particle swarm optimization ⋮ Infeasible/feasible search trajectories and directional rounding in integer programming ⋮ Proximity search for 0--1 mixed-integer convex programming ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection ⋮ The case for strategic oscillation ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs

Uses Software

• Scatter Search
• Tabu search

Cites Work

• An Introduction to Tabu Search
• Unnamed Item
• Unnamed Item

This page was built for publication: Parametric tabu-search for mixed integer programs