Jens Gottlieb

Orcid: 0000-0002-9540-9022

According to our database1, Jens Gottlieb authored at least 24 papers between 1997 and 2011.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
Vehicle routing with compartments: applications, modelling and heuristics.
OR Spectr., 2011

Improved Packing and Routing of Vehicles with Compartments.
Proceedings of the Computer Aided Systems Theory - EUROCAST 2011, 2011

2010
Vorwort.
Proceedings of the Multikonferenz Wirtschaftsinformatik, 2010

2005
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem.
Evol. Comput., 2005

Applications of Racing Algorithms: An Industrial Perspective.
Proceedings of the Artificial Evolution, 2005

2004
Editorial.
J. Math. Model. Algorithms, 2004

2003
A Study of Greedy, Local Search, and Ant Colony Optimization Approaches for Car Sequencing Problems.
Proceedings of the Applications of Evolutionary Computing, 2003

2002
Evolutionary Algorithms for the Satisfiability Problem.
Evol. Comput., 2002

Direct Representation and Variation Operators for the Fixed Charge Transportation Problem.
Proceedings of the Parallel Problem Solving from Nature, 2002

Solving Car Sequencing Problems by Local Optimization.
Proceedings of the Applications of Evolutionary Computing, 2002

2001
Evolutionäre Algorithmen für Constraint-Optimierungsprobleme.
Künstliche Intell., 2001

On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems.
Proceedings of the Applications of Evolutionary Computing, 2001

The Effects of Partial Restarts in Evolutionary Search.
Proceedings of the Artificial Evolution, 2001

2000
Selection in Evolutionary Algorithms for the Traveling Salesman Problem.
Proceedings of the Applied Computing 2000, 2000

Permutation-Based Evolutionary Algorithms for Multidimensional Knapsack Problems.
Proceedings of the Applied Computing 2000, 2000

Adaptive Fitness Functions for the Satisfiability Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000

A Comparison of Two Representations for the Fixed Charge Transportation Problem.
Proceedings of the Parallel Problem Solving from Nature, 2000

The Effects of Locality on the Dynamics of Decoder-Based Evolutionary Search.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '00), 2000

Evolutionary algorithms for constrained optimization problems.
Berichte aus der Informatik, Shaker, ISBN: 978-3-8265-7783-3, 2000

1999
Evolutionary Algorithms for Multidimensional Knapsack Problems: the Relevance of the Boundary f the Feasible Region.
Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), 1999

Characterizing Locality in Decoder-Based EAs for the Multidimensional Knapsack Problem.
Proceedings of the Artificial Evolution, 4th European Conference, 1999

On the Effectivity of Evolutionary Algorithms for the Multidimensional Knapsack Problem.
Proceedings of the Artificial Evolution, 4th European Conference, 1999

1998
Improving the Performance of Evolutionary Algorithms for the Satisfiability Problem by Refining Functions.
Proceedings of the Parallel Problem Solving from Nature, 1998

1997
Representations, Fitness Functions and Genetic Operators for the Satisfiability Problem.
Proceedings of the Artificial Evolution, Third European Conference, 1997


  Loading...