COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS

DOI10.1080/01969720590961718zbMath1082.90150OpenAlexW2044337877MaRDI QIDQ3369494

Masatoshi Sakawa, Ichiro Nishizaki

Publication date: 2 February 2006

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969720590961718

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Multilevel decision-making: a survey ⋮ An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions ⋮ On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory ⋮ Metaheuristics for bilevel optimization: a comprehensive review ⋮ The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A penalty function approach for solving bi-level linear programs
• Algorithms for solving the mixed integer two-level linear programming problem
• A solution procedure for the hierarchical coordination of constrained optimizing systems
• New Branch-and-Bound Rules for Linear Bilevel Programming
• COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS
• Two-Level Linear Programming
• The Mixed Integer Linear Bilevel Programming Problem

This page was built for publication: COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS