A computational study of parametric tabu search for 0-1 mixed integer programs

DOI10.1016/j.cor.2010.07.004zbMath1231.90298OpenAlexW2148591410MaRDI QIDQ709185

Luís Henrique Sacchi, Vinicius Amaral Armentano

Publication date: 15 October 2010

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

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

zbMATH Keywords

heuristicstabu searchmixed integer programmingpenalized branching

Mathematics Subject Classification ID

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

Related Items (2)

Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Adaptive kernel search: a heuristic for solving mixed integer linear programs

Uses Software

• MIPLIB
• CPLEX
• Benchmarks for Optimization Software
• FEASPUMP
• MIPLIB2003
• Tabu search
• DINS
• Decision tree for optimization software
• Octane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer-programming software systems
• Infeasible/feasible search trajectories and directional rounding in integer programming
• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• General purpose heuristics for integer programming. I
• General purpose heuristics for integer programming. II
• Local branching
• Solving zero-one mixed integer programming problems using tabu search
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Branching rules revisited
• Pivot and shift -- a mixed integer programming heuristic
• Repairing MIP infeasibility through local branching
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• Variable neighborhood search and local branching
• Parametric tabu-search for mixed integer programs
• The feasibility pump
• Octane: A New Heuristic for Pure 0–1 Programs
• Pivot and Complement–A Heuristic for 0-1 Programming
• Interior Path Methods for Heuristic Integer Programming Procedures
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• A Computational Study of Search Strategies for Mixed Integer Programming
• Tabu search within a pivot and complement framework
• DINS, a MIP Improvement Heuristic
• Efficient Heuristic Procedures for Integer Linear Programming with an Interior
• Experiments in mixed-integer linear programming

This page was built for publication: A computational study of parametric tabu search for 0-1 mixed integer programs