Clausen Jens

Jens Clausen

Information about the author Jens Clausen will soon be added to the site.
Found 10 papers in total
Using heuristics to solve the dedicated aircraft recovery problem
Using heuristics to solve the dedicated aircraft recovery problem
2005
The Dedicated Aircraft Recovery Problem (DARP) involves decisions concerning aircraft...
A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case
A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case
2006
The ELDSP problem is a combined lot sizing and sequencing problem. A supplier produces...
Constructing periodic timetables using MIP – a case study from DSB S-train
Constructing periodic timetables using MIP – a case study from DSB S-train
2006
We describe a mathematical model to create operational timetable alternatives in DSB...
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
1999
The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are...
Solving graph bisection problems with semidefinite programming
Solving graph bisection problems with semidefinite programming
2000
An exact solution method for the graph bisection problem is presented. We describe a...
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
1998
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard...
Parallel branch-and-bound methods for the job-shop scheduling problem
Parallel branch-and-bound methods for the job-shop scheduling problem
1998
Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class...
Solving large quadratic assignment problems in parallel
Solving large quadratic assignment problems in parallel
1997
Quadratic Assignment (QAPs)problems are in practice among the most difficult to solve...
The usefulness and beauty of combinatorial optimization
The usefulness and beauty of combinatorial optimization
1995
Disregarding combinatorial optimization as an attractive platform for academic...
Implementations of parallel branch-and-bound algorithms: Experience with the graph partitioning problem
Implementations of parallel branch-and-bound algorithms: Experience with the graph partitioning problem
1991
Parallel processing is one of the essential concepts in the attempts to increase the...
Papers per page: