| Publication | Date of Publication | Type |
|---|
| An iterated local search for a multi‐period orienteering problem arising in a car patrolling application | 2024-01-18 | Paper |
| An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem† | 2023-11-16 | Paper |
| An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion | 2022-12-01 | Paper |
| An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion | 2020-12-10 | Paper |
| Relaxation heuristics for the set multicover problem with generalized upper bound constraints | 2018-07-11 | Paper |
| EFFICIENT OVERLAP DETECTION AND CONSTRUCTION ALGORITHMS FOR THE BITMAP SHAPE PACKING PROBLEM | 2018-05-18 | Paper |
| Efficient implementations of construction heuristics for the rectilinear block packing problem | 2016-11-10 | Paper |
| A PARTITION-BASED HEURISTIC ALGORITHM FOR THE RECTILINEAR BLOCK PACKING PROBLEM | 2016-10-27 | Paper |
| Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem | 2016-01-25 | Paper |
| ENUMERATING BOTTOM-LEFT STABLE POSITIONS FOR RECTANGLE PLACEMENTS WITH OVERLAP | 2014-09-09 | Paper |
| Recent progress of local search in handling the time window constraints of the vehicle routing problem | 2013-08-08 | Paper |
| LAGRANGIAN-BASED COLUMN GENERATION FOR THE NODE CAPACITATED IN-TREE PACKING PROBLEM(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) | 2012-12-08 | Paper |
| An LP-based heuristic algorithm for the node capacitated in-tree packing problem | 2012-11-15 | Paper |
| The complexity of the node capacitated in-tree packing problem | 2012-06-18 | Paper |
| An Ejection Chain Approach for the Generalized Assignment Problem | 2012-06-08 | Paper |
| Efficient local search algorithms for the linear ordering problem | 2011-05-20 | Paper |
| Efficient branch-and-bound algorithms for weighted MAX-2-SAT | 2011-05-11 | Paper |
| A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions | 2011-02-16 | Paper |
| Recent progress of local search in handling the time window constraints of the vehicle routing problem | 2010-12-06 | Paper |
| COMPUTING BOUNDS ON RISK-NEUTRAL DISTRIBUTIONS FROM THE OBSERVED PRICES OF CALL OPTIONS | 2010-06-10 | Paper |
| Solving the irregular strip packing problem via guided local search for overlap minimization | 2010-01-29 | Paper |
| An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem | 2009-11-23 | Paper |
| The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio | 2009-10-15 | Paper |
| A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions | 2009-07-23 | Paper |
| Exact algorithms for the two-dimensional strip packing problem with and without rotations | 2009-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3632444 | 2009-06-11 | Paper |
| An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem | 2009-01-19 | Paper |
| An iterated local search algorithm for the time-dependent vehicle routing problem with time windows | 2008-10-29 | Paper |
| An iterated local search algorithm for the vehicle routing problem with convex time penalty functions | 2008-09-10 | Paper |
| New Bounds for the Nearly Equitable Edge Coloring Problem | 2008-05-27 | Paper |
| RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) | 2008-04-29 | Paper |
| A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem | 2007-11-29 | Paper |
| A Set Covering Approach for the Pickup and Delivery Problem with General Constraints on Each Route | 2007-11-29 | Paper |
| Duality in option pricing based on prices of other derivatives | 2007-08-27 | Paper |
| The vehicle routing problem with flexible time windows and traveling times | 2007-01-09 | Paper |
| One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming | 2006-09-28 | Paper |
| A 3-flip neighborhood local search for the set covering problem | 2006-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3368654 | 2006-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3368659 | 2006-02-08 | Paper |
| A path relinking approach with ejection chains for the generalized assignment problem | 2005-10-26 | Paper |
| A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem | 2005-08-22 | Paper |
| Improved local search algorithms for the rectangle packing problem with general spatial costs | 2005-08-01 | Paper |
| A decomposability index in logical analysis of data | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474096 | 2004-08-04 | Paper |
| Local search algorithms for the rectangle packing problem with general spatial costs | 2003-09-01 | Paper |
| Finding essential attributes from binary data | 2003-08-21 | Paper |
| One-dimensional cutting stock problem to minimize the number of different patterns | 2003-04-10 | Paper |
| Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation | 2002-12-15 | Paper |
| Analyses on the 2 and 3-flip neighborhoods for the MAX SAT | 2001-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761945 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761947 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761950 | 2001-02-21 | Paper |
| A variable depth search algorithm with branching search for the generalized assignment problem | 2000-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495204 | 2000-08-10 | Paper |
| Fast algorithms to enumerate all common intervals of two permutations | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703155 | 1999-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218412 | 1998-11-11 | Paper |
| The use of dynamic programming in genetic algorithms for permutation problems | 1998-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350037 | 1997-08-28 | Paper |
