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

DOI10.1080/01969720590961718MaRDI QIDQ3369494zbMATH OpenOpenAlexFDO

Authors Ichiro Nishizaki, Masatoshi Sakawa

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

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

Recommendations

• COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS
• Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms
• Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
• On-line computation of Stackelberg equilibria with synchronous parallel genetic algorithms
• Off-line computation of Stackelberg solutions with the genetic algorithm

Cites work

• scientific article; zbMATH DE number 35514 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• A penalty function approach for solving bi-level linear programs
• A solution procedure for the hierarchical coordination of constrained optimizing systems
• Algorithms for solving the mixed integer two-level linear programming problem
• COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS
• New Branch-and-Bound Rules for Linear Bilevel Programming
• The Mixed Integer Linear Bilevel Programming Problem
• Two-Level Linear Programming

Cited in

(10)

• A comparison of genetic and conventional methods for the solution of integer goal programmes
• Metaheuristics for bilevel optimization: a comprehensive review
• A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• An optimization approach to gene stacking
• On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory
• COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL MIXED ZERO-ONE PROGRAMMING PROBLEMS
• Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)
• The Watermelon Algorithm for The Bilevel Integer Linear Programming Problem
• Multilevel decision-making: a survey

Describes a project that uses

Uses Software

• Genocop

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369494)