EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Research Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: isPartOf:"Working Papers on Information Processing and Information Management"
Narrow search

Narrow search

Year of publication
Subject
All
Branch-and-Bound-Methode 2 Globale Optimierung 2 Entwurfsmuster 1 Internet 1 Object-oriented analysis 1 Objektorientierte Analyse 1 Prozessmanagement 1 Software Engineering 1 Softwareentwicklung 1 workflow management 1
more ... less ...
Online availability
All
Free 4
Type of publication
All
Book / Working Paper 4
Language
All
English 4
Author
All
Stix, Volker 3 Hahsler, Michael 1
Institution
All
Institut für Informationsverarbeitung und -wirtschaft <Wien> 1
Published in...
All
Wirtschaftsuniversität Wien - Forschungsbezogene elektronische Publikationen 3 Working Papers on Information Processing and Information Management 3 Wirtschaftsuniversität Wien - Forschungsbezogene elektronische Publikationen - Working Papers 1 Wirtschaftsuniversität Wien - Institut für Informationsverarbeitung und -wirtschaft - Working Papers on Information Processing and Information Management 1
Source
All
USB Cologne (business full texts) 4
Showing 1 - 4 of 4
Cover Image
Stochastic branch & bound applying target oriented branch & bound method to optimal scenario tree reduction
Stix, Volker - 2001
In this article a new branch & bound method is described. It uses an artificial target to improve its bounding capabilities. Therefore the new approach is faster compared to the classical one....
Persistent link: https://www.econbiz.de/10005841591
Saved in:
Cover Image
Target oriented branch & bound method for global optimization
Stix, Volker - Institut für Informationsverarbeitung und -wirtschaft … - 2001
We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule....
Persistent link: https://www.econbiz.de/10005841592
Saved in:
Cover Image
Software engineering with analysis patterns
Hahsler, Michael - 2001
Tätigkeitsfeld Informationsverarbeitung und Informationswirtschaft Working Papers on Information Processing and Information … Management Nr./No. 01/2001 Herausgeber / Editor: Institut für Informationsverabeitung und Informationswirtschaft …
Persistent link: https://www.econbiz.de/10005841614
Saved in:
Cover Image
Finding all maximal cliques in dynamic graphs
Stix, Volker - 2001
This paper discusses potentials and drawbacks for maximum clique.
Persistent link: https://www.econbiz.de/10005841590
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...