The scientist’s investigation covers issues in Mathematical optimization, Metaheuristic, Ant colony optimization algorithms, Combinatorial optimization and Operations research. Pareto principle, Stochastic optimization and Simulated annealing are among the areas of Mathematical optimization where Walter J. Gutjahr concentrates his study. His work deals with themes such as Genetic algorithm, Project portfolio management and Heuristic, which intersect with Metaheuristic.
His Ant colony optimization algorithms research includes elements of Swarm intelligence and Meta-optimization. His research in Combinatorial optimization tackles topics such as Optimization problem which are related to areas like Tabu search, Differential evolution and Graph. Walter J. Gutjahr focuses mostly in the field of Operations research, narrowing it down to matters related to Greedy algorithm and, in some cases, Weighted arithmetic mean.
His primary scientific interests are in Mathematical optimization, Metaheuristic, Ant colony optimization algorithms, Stochastic optimization and Operations research. His research combines Algorithm and Mathematical optimization. His study looks at the relationship between Metaheuristic and topics such as Project portfolio management, which overlap with Management science and Selection.
His biological study spans a wide range of topics, including Simulated annealing, Parallel metaheuristic, Meta-optimization, Graph and Swarm intelligence. In his study, which falls under the umbrella issue of Stochastic optimization, Business process is strongly linked to Branch and bound. His studies in Operations research integrate themes in fields like Genetic algorithm, Greedy algorithm and Weighted arithmetic mean.
His primary areas of investigation include Mathematical optimization, Humanitarian Logistics, Multi-objective optimization, Stochastic optimization and Stochastic programming. His Mathematical optimization research includes themes of Schedule and Decomposition. His Humanitarian Logistics study integrates concerns from other disciplines, such as Microeconomics, Minification and Operations research.
In his research, Discrete event simulation is intimately related to Metaheuristic, which falls under the overarching field of Operations research. His Multi-objective optimization course of study focuses on Stochastic dominance and Stochastic modelling and Probabilistic-based design optimization. The Stochastic optimization study combines topics in areas such as Dynamic decision-making, Function and Global optimization.
Walter J. Gutjahr focuses on Humanitarian Logistics, Multi-objective optimization, Mathematical optimization, Operations research and Natural disaster. The various areas that Walter J. Gutjahr examines in his Humanitarian Logistics study include Microeconomics, Equity, Management science and Minification. Walter J. Gutjahr combines subjects such as Decision problem, Stochastic dominance and Probabilistic-based design optimization with his study of Multi-objective optimization.
His Mathematical optimization study frequently draws connections to other fields, such as Constraint. His Operations research research integrates issues from Orienteering, Constraint, Decision support system, Theory of computation and Evolutionary algorithm. His Stochastic programming research is multidisciplinary, incorporating perspectives in Multiple-criteria decision analysis, Stochastic modelling and Stochastic optimization.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A survey on metaheuristics for stochastic combinatorial optimization
Leonora Bianchi;Marco Dorigo;Luca Maria Gambardella;Walter J. Gutjahr.
Natural Computing (2009)
A survey on metaheuristics for stochastic combinatorial optimization
Leonora Bianchi;Marco Dorigo;Luca Maria Gambardella;Walter J. Gutjahr.
Natural Computing (2009)
A Graph-based Ant system and its convergence
Walter J. Gutjahr.
Future Generation Computer Systems (2000)
A Graph-based Ant system and its convergence
Walter J. Gutjahr.
Future Generation Computer Systems (2000)
Pareto Ant Colony Optimization: A metaheuristic approach to multiobjective portfolio selection
Karl F. Doerner;Walter J. Gutjahr;Richard F. Hartl;Christine Strauss.
Annals of Operations Research (2004)
Pareto Ant Colony Optimization: A metaheuristic approach to multiobjective portfolio selection
Karl F. Doerner;Walter J. Gutjahr;Richard F. Hartl;Christine Strauss.
Annals of Operations Research (2004)
ACO algorithms with guaranteed convergence to the optimal solution
Walter J. Gutjahr.
Information Processing Letters (2002)
ACO algorithms with guaranteed convergence to the optimal solution
Walter J. Gutjahr.
Information Processing Letters (2002)
A math-heuristic for the warehouse location-routing problem in disaster relief
Stefan Rath;Walter J. Gutjahr.
Computers & Operations Research (2014)
A math-heuristic for the warehouse location-routing problem in disaster relief
Stefan Rath;Walter J. Gutjahr.
Computers & Operations Research (2014)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Vienna
University of Vienna
University of Portsmouth
TU Wien
University of Southampton
University of Bologna
University of Vienna
INSEAD
Polytechnique Montréal
Rutgers, The State University of New Jersey
University of Arizona
Polytechnic University of Milan
University of Münster
Seoul National University
Max Planck Society
Federal University of Toulouse Midi-Pyrénées
Medical University of South Carolina
University of Zurich
University of California, Davis
Kyungpook National University
University College London
Virginia Tech
Rice University
Texas A&M University
University of British Columbia
Peking University