Solving zero-one mixed integer programming problems using tabu search

DOI10.1016/S0377-2217(97)00295-6zbMath0991.90091OpenAlexW1980202436MaRDI QIDQ1609922

Fred Glover, Arne Løkketangen

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00295-6

zbMATH Keywords

heuristicsinteger programmingtabu search

Mathematics Subject Classification ID

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

Related Items

Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, Effect of solution representations on tabu search in scheduling applications, Discrete dynamical system approaches for Boolean polynomial optimization, Mathematical programming based heuristics for the 0--1 MIP: a survey, Matheuristics: survey and synthesis, Adaptive kernel search: a heuristic for solving mixed integer linear programs, Feasibility jump: an LP-free Lagrangian MIP heuristic, An interior point cutting plane heuristic for mixed integer programming, A variable neighborhood decomposition search method for supply chain management planning problems, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, A modified PSO algorithm for minimizing the total costs of resources in MRCPSP, The multidimensional 0-1 knapsack problem: an overview., Repairing MIP infeasibility through local branching, Boosting the feasibility pump, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, Shift-and-propagate, A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays, Variable neighborhood search and local branching, Adaptive memory search for multidemand multidimensional knapsack problems, Multiple machine JIT scheduling: a tabu search approach, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, A computational study of parametric tabu search for 0-1 mixed integer programs, Revenue maximization of Internet of things provider using variable neighbourhood search, Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments, RENS. The optimal rounding, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, An efficient linearization approach for mixed-integer problems, A linearization method for mixed 0--1 polynomial programs, Feasibility pump 2.0, The feasibility pump, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Metaheuristics in combinatorial optimization

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• New approaches for heuristic search: A bilateral linkage with artificial intelligence
• Some experiments with simulated annealing techniques for packing problems
• The depth and width of local minima in discrete solution spaces
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• Semi-greedy heuristics: An empirical study
• Testing heuristics: We have it all wrong
• A user's guide to tabu search
• Dynamic tabu list management using the reverse elimination method
• Pivot and Complement–A Heuristic for 0-1 Programming
• Tabu Search—Part I
• General Purpose Simulated Annealing
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
• Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• Tabu search within a pivot and complement framework
• An Approach to Zero-One Integer Programming
• A Note on Linear Programming and Integer Feasibility