Hybrid extreme point tabu search

DOI10.1016/S0377-2217(97)00297-XzbMath0991.90121OpenAlexW2067376465MaRDI QIDQ1609924

Kristin P. Bennett, Jennifer A. Blue

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)00297-x

zbMATH Keywords

classificationglobal optimizationtabu searchbilinear programmingmachine learning

Mathematics Subject Classification ID

Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05) Search theory (90B40)

Related Items

Tabu search approaches for solving the two-group classification problem, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem

Uses Software

• UCI-ml
• MINOS
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of polyhedral separability
• Bilinear separation of two sets in \(n\)-space
• Handbook of global optimization
• A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
• A complementarity approach to a quasistatic multi-rigid-body contact problem
• The extended linear complementarity problem
• Tabu search applied to the general fixed charge problem
• A branch-and-bound algorithm for solving fixed charge problems
• Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
• Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
• Tabu search within a pivot and complement framework