Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems

Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems

This paper presents a tabu search-based heuristic solver for general integer linear programming (ILP) problems as a dependable alternative to branch-and-bound (B&B) solvers. It aims to expand the range of ILP instances for which optimization practitioners can obtain reasonable solutions u...

Full description

Bibliographic Details
Main Author: Yuji Koguma
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Access
Subjects:
Integer linear programming
heuristics
metaheuristics
tabu search
local search
Online Access:https://ieeexplore.ieee.org/document/10418217/

Internet

https://ieeexplore.ieee.org/document/10418217/

Similar Items