A simple tabu search method to solve the mixed-integer linear bilevel programming problem
type: Item
instance of: scholarly article
title: A simple tabu search method to solve the mixed-integer linear bilevel programming problem
zbMATH Open document ID: 0908.90194
DOI: 10.1016/0377-2217(94)00215-0
author: A. D. Huang
author: Ue-Pyng Wen
published in: European Journal of Operational Research
publication date: 1998-10-07T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B70
Mathematics Subject Classification ID: 91A65
zbMATH DE Number: 1208571
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: multilevel programming
zbMATH Keywords: decentralized planning problems
zbMATH Keywords: hierarchical planning
zbMATH Keywords: mixed-integer linear bilevel programming
zbMATH Keywords: simple tabu search
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00215-0
OpenAlex ID: W1985447622
cites work: Path assignment for call routing: An application of tabu search
cites work: An Algorithm for Solving the General Bilevel Programming Problem
cites work: Two-Level Linear Programming
cites work: Applying tabu search to the job-shop scheduling problem
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Q4495496
cites work: Using tabu search techniques for graph coloring
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
cites work: The Mixed Integer Linear Bilevel Programming Problem
cites work: Q3211108
cites work: Algorithms for solving the mixed integer two-level linear programming problem
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: A new heuristic method for the flow shop sequencing problem
description: scientific article; zbMATH DE number 1208571