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

DOI10.1016/J.COR.2010.07.004MaRDI QIDQ709185zbMATHOpenAlexFDO

Authors 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

heuristicsmixed integer programmingtabu searchpenalized branching

Mathematics Subject Classification ID

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

Recommendations

• Parametric tabu-search for mixed integer programs
• scientific article; zbMATH DE number 2209656
• Solving zero-one mixed integer programming problems using tabu search
• scientific article; zbMATH DE number 1054950
• A branch-and-bound algorithm for 0-1 parametric mixed integer programming

Cites work

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

Cited in

(5)

• Solving zero-one mixed integer programming problems using tabu search
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• scientific article; zbMATH DE number 1054950 (Why is no real title available?)
• Adaptive kernel search: a heuristic for solving mixed integer linear programs
• Parametric tabu-search for mixed integer programs

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709185)