| Publication | Date of Publication | Type |
|---|
Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences
Computers & Operations Research | 2024-06-25 | Paper |
Consistency cuts for Dantzig-Wolfe reformulations
Operations Research | 2022-12-01 | Paper |
Optimising the slab yard planning and crane scheduling problem using a two-stage heuristic
International Journal of Production Research | 2010-10-25 | Paper |
Disruption Management in Passenger Railway Transportation
Robust and Online Large-Scale Optimization | 2009-12-03 | Paper |
Mortgage loan portfolio optimization using multi-stage stochastic programming
Journal of Economic Dynamics and Control | 2009-05-18 | Paper |
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
Computers & Operations Research | 2008-12-04 | Paper |
Zeno and Anti-Zeno Dynamics
Decoherence, Entanglement and Information Protection in Complex Quantum Systems | 2007-11-05 | Paper |
Cheating on complementarity and interference by translational-internal entanglement
Quantum Information Processing | 2006-11-22 | Paper |
A hybrid algorithm for solving the economic lot and delivery scheduling problem in the common cycle case
European Journal of Operational Research | 2006-10-27 | Paper |
Constructing periodic timetables using MIP -- a case study from DSB S-train
International Journal of Operational Research | 2006-10-04 | Paper |
Solving Graph Bisection Problems with Semidefinite Programming
INFORMS Journal on Computing | 2003-10-28 | Paper |
An \(O(| V|^*| E|)\) algorithm for finding immediate multiple-vertex dominators
Information Processing Letters | 2003-06-24 | Paper |
A dual framework for lower bounds of the quadratic assignment problem based on linearization
Computing | 2000-03-16 | Paper |
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
Annals of Operations Research | 1999-12-02 | Paper |
| scientific article; zbMATH DE number 1304344 (Why is no real title available?) | 1999-06-17 | Paper |
Parallel branch-and-bound methods for the job-shop scheduling problem
Annals of Operations Research | 1998-12-06 | Paper |
Solving large-scale QAP problems in parallel with the serach library ZRAM
Journal of Parallel and Distributed Computing | 1998-11-01 | Paper |
| scientific article; zbMATH DE number 1187082 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1163098 (Why is no real title available?) | 1998-07-29 | Paper |
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
Computational Optimization and Applications | 1998-07-01 | Paper |
Solving large quadratic assignment problems in parallel
Computational Optimization and Applications | 1998-05-25 | Paper |
| scientific article; zbMATH DE number 842126 (Why is no real title available?) | 1996-02-06 | Paper |
| scientific article; zbMATH DE number 792643 (Why is no real title available?) | 1995-09-04 | Paper |
Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
Annals of Operations Research | 1992-06-27 | Paper |
Arranging apples in an array
BIT | 1988-01-01 | Paper |
A note on the Edmonds-Fukuda pivoting rule for simplex algorithms
European Journal of Operational Research | 1987-01-01 | Paper |
A new family of exponential LP problems
European Journal of Operational Research | 1987-01-01 | Paper |
A method for detecting structure in polyhedra
Pattern Recognition Letters | 1984-01-01 | Paper |
Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
Mathematical Programming Studies | 1980-01-01 | Paper |
