Jens Clausen

Available identifiers

zbMath Open clausen.jens-vintherMaRDI QIDQ851893

List of research outcomes

Publication	Date of Publication	Type
Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences	2024-06-25	Paper
Consistency Cuts for Dantzig-Wolfe Reformulations	2022-12-01	Paper
Optimising the Slab Yard Planning and Crane Scheduling Problem using a two-stage heuristic	2010-10-25	Paper
Disruption Management in Passenger Railway Transportation	2009-12-03	Paper
Mortgage loan portfolio optimization using multi-stage stochastic programming	2009-05-18	Paper
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach	2008-12-04	Paper
Zeno and Anti-Zeno Dynamics	2007-11-05	Paper
Cheating on complementarity and interference by translational-internal entanglement	2006-11-22	Paper
A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case	2006-10-27	Paper
Constructing periodic timetables using MIP -- a case study from DSB S-train	2006-10-04	Paper
Solving Graph Bisection Problems with Semidefinite Programming	2003-10-28	Paper
An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators	2003-06-24	Paper
A dual framework for lower bounds of the quadratic assignment problem based on linearization	2000-03-16	Paper
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search	1999-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4251076	1999-06-17	Paper
Parallel branch-and-bound methods for the job-shop scheduling problem	1998-12-06	Paper
Solving large-scale QAP problems in parallel with the serach library ZRAM	1998-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q3840284	1998-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4394587	1998-07-29	Paper
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel	1998-07-01	Paper
Solving large quadratic assignment problems in parallel	1998-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q4862294	1996-02-06	Paper
https://portal.mardi4nfdi.de/entity/Q4845152	1995-09-04	Paper
Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem	1992-06-27	Paper
Arranging apples in an array	1988-01-01	Paper
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms	1987-01-01	Paper
A new family of exponential LP problems	1987-01-01	Paper
A method for detecting structure in polyhedra	1984-01-01	Paper
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory	1980-01-01	Paper

Research outcomes over time

This page was built for person: Jens Clausen