Referenced Items are not available for this document.
We develop computational methods through genetic algorithms for obtaining Stackelberg solutions to two-level zero-one programming problems. To demonstrate the feasibility and efficiency of the proposed methods, computational experiments are carried out and comparisons between the J.F. Bard and J.T. Moore (1990) method based on the implicit enumeration techniques and the proposed methods are provided
Published in:
Industrial Electronics Society, 2000. IECON 2000. 26th Annual Confjerence of the IEEE
(Volume:4
)
Date of Conference: 2000
- Page(s):
- 2750 - 2755 vol.4
- Meeting Date :
- 22 Oct 2000-28 Oct 2000
- Print ISBN:
- 0-7803-6456-2
- INSPEC Accession Number:
- 7274768
- Conference Location :
- Nagoya
- Digital Object Identifier :
- 10.1109/IECON.2000.972433
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
