Clausen, Jens, 1950-
Clausen, Jens f. 1950
Clausen, Jens
Jens Clausen dánský odborník v oblasti matematického modelování, pedagog
VIAF ID: 114406781 ( Personal )
Permalink: http://viaf.org/viaf/114406781
Preferred Forms
- 100 1 _ ‡a Clausen, Jens
-
-
- 100 1 _ ‡a Clausen, Jens ‡d 1950-
-
-
-
- 100 1 0 ‡a Clausen, Jens, ‡d 1950-
-
-
- 100 0 _ ‡a Jens Clausen ‡c dánský odborník v oblasti matematického modelování, pedagog
5xx's: Related Names (2)
- 510 2 _ ‡a Instituttet for Matematisk Modellering
- 510 2 _ ‡a Instituttet for Matematisk Modellering ‡9 g:Lyngby-Tårbaek ‡e Affiliation
Works
Title | Sources |
---|---|
Arranging apples in an array | |
Crane scheduling for a plate storage | |
Decentralized ground staff scheduling | |
Disruption management in the airline industry - concepts, models and methods | |
Do inherently sequential Branch-and-Bound algorithms exist? | |
EDB miniordbog | |
Finding k edge-disjoint spanning trees of minimum total weight in a network | |
Global optimization by means of branch and bound with simplex based covering | |
Hierarchical network design using simulated annealing | |
Integer programming and combinatorial optimization : 4th International IPCO Conference, Copenhagen, Denmark, May 29-31, 1995 : proceedings | |
Løsning af svære kombinatoriske optimeringsproblemer - kan paralleldatamater hjælpe? | |
An NP-complete matroid parity problem | |
On feasibility of the Edmonds-Fukuda pivoting rule for oriented matroid programming | |
On the best search strategy in parallel branch-and-bound | |
On the maximum expected flow algorithm of N. Sancho | |
Optimal reinsertion of cancelled train lines | |
Optimization and simulation in drug development | |
På job i edb-branchen 1986-1991 | |
Parallel branch-and-bound methods for the job-shop scheduling problem | |
Parallel branch and bound - principles and personal experiences | |
Parallel graph partitioning using branch-and-bound with dynamic distribution of subproblems | |
Solving graph bisection problems with semidefinite programming | |
Solving large quadratic assignment problems in parallel | |
Teknologi og uddannelse | |
A tutorial note on the complexity of the Simplex-algorithm | |
Two families of bad LP-problems | |
Using parallel computers to solve the vehicle routing problem with time windows | |
Worst-case behaviour of simplex-algorithms | |
A ¤bipartite matching algorithm based on matroid partition | |
An ¤easily computable lower bound for the graph partitioning problem | |
An ¤exact algorithm for aircraft landing problem | |
A ¤family of bipartite cardinality matching problems solvable in 0(n²) time | |
A ¤hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case | |
An ¤O (V*E) algorithm for finding immediate multiple-vertex dominators | |
The ¤usefulness and beauty of combinatorial optimization |