Infeasible/feasible search trajectories and directional rounding in integer programming

DOI10.1007/s10732-007-9029-zzbMath1146.90040OpenAlexW2151695306MaRDI QIDQ930155

Fred Glover

Publication date: 23 June 2008

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-007-9029-z

zbMATH Keywords

adaptive memory

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization ⋮ The case for strategic oscillation ⋮ A computational study of parametric tabu search for 0-1 mixed integer programs

Uses Software

• Tabu search

Cites Work

• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• Scatter search and star-paths: Beyond the genetic metaphor
• Parametric tabu-search for mixed integer programs
• Bandwidth Packing: A Tabu Search Approach
• Unnamed Item
• Unnamed Item

This page was built for publication: Infeasible/feasible search trajectories and directional rounding in integer programming