A simple tabu search method to solve the mixed-integer linear bilevel programming problem
DOI10.1016/0377-2217(94)00215-0zbMath0908.90194OpenAlexW1985447622MaRDI QIDQ1266629
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00215-0
heuristic algorithmmultilevel programminghierarchical planningdecentralized planning problemsmixed-integer linear bilevel programmingsimple tabu search
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Hierarchical games (including Stackelberg games) (91A65) Theory of organizations, manpower planning in operations research (90B70)
Related Items (29)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Using tabu search techniques for graph coloring
- Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
- A new heuristic method for the flow shop sequencing problem
- Tabu search techniques. A tutorial and an application to neural networks
- Future paths for integer programming and links to artificial intelligence
- Algorithms for solving the mixed integer two-level linear programming problem
- Applying tabu search to the job-shop scheduling problem
- Path assignment for call routing: An application of tabu search
- An Algorithm for Solving the General Bilevel Programming Problem
- Tabu Search—Part I
- Two-Level Linear Programming
- The Mixed Integer Linear Bilevel Programming Problem
This page was built for publication: A simple tabu search method to solve the mixed-integer linear bilevel programming problem