On the Connectedness of Coincidences and Zero Points of Mappings
No abstract is available for this item.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||Aug 2003|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.imw.uni-bielefeld.de/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- repec:ner:tilbur:urn:nbn:nl:ui:12-153111 is not listed on IDEAS
- Talman, A.J.J. & Yamamoto, Y., 1989. "A simplicial algorithm for stationary point problems on polytopes," Other publications TiSEM 0d6b2de0-17c0-4d5e-963f-5, Tilburg University, School of Economics and Management.
When requesting a correction, please mention this item's handle: RePEc:bie:wpaper:353. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dr. Frederik Herzberg)
If references are entirely missing, you can add them using this form.