| Publication | Date of Publication | Type |
|---|
| Lagrangian matheuristics for the quadratic multiple knapsack problem | 2023-05-15 | Paper |
| An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion | 2022-12-01 | Paper |
| A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems | 2022-08-30 | Paper |
| Knapsack problems -- an overview of recent advances. I: Single knapsack problems | 2022-06-22 | Paper |
| Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems | 2022-06-22 | Paper |
| 2DPackLib: a two-dimensional cutting and packing library | 2022-03-15 | Paper |
| Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem | 2021-06-07 | Paper |
| The assignment and loading transportation problem | 2021-06-03 | Paper |
| Exact solution techniques for two-dimensional cutting and packing | 2021-06-03 | Paper |
| Lower and upper bounds for the non-linear generalized assignment problem | 2021-04-20 | Paper |
| An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion | 2020-12-10 | Paper |
| Comments on: ``A comparative study of time aggregation techniques in relation to power capacity-expansion modeling | 2019-11-07 | Paper |
| Surveys in operations research | 2019-03-06 | Paper |
| Mathematical models and decomposition methods for the multiple knapsack problem | 2019-01-09 | Paper |
| Relaxations and heuristics for the multiple non-linear separable knapsack problem | 2018-07-11 | Paper |
| Logic based Benders' decomposition for orthogonal stock cutting problems | 2018-07-11 | Paper |
| BPPLIB: a library for bin packing and cutting stock problems | 2018-04-19 | Paper |
| Heuristics for the general multiple non-linear knapsack problem | 2017-02-14 | Paper |
| A brand new cheating attempt: a case of usurped identity | 2017-01-13 | Paper |
| Models and algorithms for packing rectangles into the smallest square | 2016-11-17 | Paper |
| Bin packing and cutting stock problems: mathematical models and exact algorithms | 2016-10-07 | Paper |
| Twelve surveys in operations research | 2016-07-22 | Paper |
| Optimistic MILP modeling of non-linear optimization problems | 2016-06-24 | Paper |
| Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem | 2016-01-25 | Paper |
| Review: An annotated bibliography of combined routing and loading problems | 2014-11-14 | Paper |
| An annotated bibliography of combined routing and loading problems | 2014-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4902799 | 2013-01-17 | Paper |
| A look at the past and present of optimization - an editorial | 2012-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3145801 | 2012-12-23 | Paper |
| Complexity and approximation of an area packing problem | 2012-11-30 | Paper |
| Heuristic and exact algorithms for the identical parallel machine scheduling problem | 2012-07-28 | Paper |
| An exact approach to the strip-packing problem | 2012-05-30 | Paper |
| A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems | 2012-02-19 | Paper |
| Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem | 2012-02-12 | Paper |
| Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication | 2011-02-08 | Paper |
| An aggregate label setting policy for the multi-objective shortest path problem | 2010-12-20 | Paper |
| Routing problems with loading constraints | 2010-12-13 | Paper |
| Models and algorithms for fair layout optimization problems | 2010-12-13 | Paper |
| Rejoinder on: Routing problems with loading constraints | 2010-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059312 | 2010-12-08 | Paper |
| Heuristic algorithms for the general nonlinear separable knapsack problem | 2010-10-15 | Paper |
| Piecewise linear approximation of functions of two variables in MILP models | 2010-03-18 | Paper |
| Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems | 2009-07-18 | Paper |
| An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem | 2009-07-09 | Paper |
| Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems | 2009-01-07 | Paper |
| Assignment Problems | 2008-10-31 | Paper |
| An optimization problem in the electricity market | 2008-03-14 | Paper |
| Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints | 2008-03-12 | Paper |
| A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints | 2008-01-08 | Paper |
| Editorial notes: 4OR for what purpose? | 2007-12-24 | Paper |
| Packing into the smallest square: worst-case analysis of lower bounds | 2007-02-20 | Paper |
| A case of plagiarism: Dănuţ Marcu | 2007-01-24 | Paper |
| Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem | 2006-03-22 | Paper |
| TSpack: A unified tabu search code for multi-dimensional bin packing problems | 2005-01-17 | Paper |
| Models and bounds for two-dimensional level packing problems | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452972 | 2004-03-07 | Paper |
| Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems | 2003-11-06 | Paper |
| Upper bounds and algorithms for the maximum cardinality bin packing problem. | 2003-07-30 | Paper |
| Heuristic algorithms for the three-dimensional bin packing problem | 2002-11-17 | Paper |
| Two-dimensional packing problems: a survey | 2002-11-17 | Paper |
| Recent advances on two-dimensional bin packing problems | 2002-09-17 | Paper |
| The Three-Dimensional Bin Packing Problem | 2002-06-04 | Paper |
| A lower bound for the non-oriented two-dimensional bin packing problem | 2002-05-15 | Paper |
| Exact solution of the two-dimensional finite bin packing problem | 2002-04-17 | Paper |
| Bounds for the cardinality constrained \(P \|C_{max}\) problem | 2001-08-27 | Paper |
| Reduction of the three-partition problem | 2001-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495176 | 2000-08-10 | Paper |
| New trends in exact algorithms for the \(0-1\) knapsack problem | 2000-07-09 | Paper |
| Approximation algorithm for the oriented two-dimensional bin packing problem | 2000-06-14 | Paper |
| On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems | 1998-11-08 | Paper |
| Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems | 1998-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398358 | 1998-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398377 | 1998-07-19 | Paper |
| A note on exact algorithms for the bottleneck generalized assignment problem | 1998-06-11 | Paper |
| The \(k\)-cardinality assignment problem | 1998-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350084 | 1997-08-28 | Paper |
| Exact and approximation algorithms for makespan minimization on unrelated parallel machines | 1997-08-10 | Paper |
| Optimal Scheduling of Tasks on Identical Parallel Processors | 1997-03-25 | Paper |
| Open shop, satellite communication and a theorem by Egerváry (1931) | 1997-02-11 | Paper |
| Minimizing the sum of weighted completion times with unrestricted weights | 1995-12-03 | Paper |
| An exact algorithm for the dual bin packing problem | 1995-06-19 | Paper |
| The bottleneck generalized assignment problem | 1995-01-01 | Paper |
| The Delivery Man Problem and Cumulative Matroids | 1994-07-13 | Paper |
| Algorithms for minimizing maximum lateness with unit length tasks and resource constraints | 1993-06-29 | Paper |
| A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3993418 | 1993-01-23 | Paper |
| Approximation Algorithms for Fixed Job Schedule Problems | 1992-06-28 | Paper |
| The selective travelling salesman problem | 1990-01-01 | Paper |
| An exact algorithm for large unbounded knapsack problems | 1990-01-01 | Paper |
| Lower bounds and reduction procedures for the bin packing problem | 1990-01-01 | Paper |
| The Fixed Job Schedule Problem with Working-Time Constraints | 1989-01-01 | Paper |
| A New Algorithm for the 0-1 Knapsack Problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751373 | 1987-01-01 | Paper |
| The Fixed Job Schedule Problem with Spread-Time Constraints | 1987-01-01 | Paper |
| Worst-case analysis of the differencing method for the partition problem | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751378 | 1987-01-01 | Paper |
| A heuristic approach to the bus driver scheduling problem | 1986-01-01 | Paper |
| Most and least uniform spanning trees | 1986-01-01 | Paper |
| Algorithm 632: A program for the 0–1 multiple knapsack problem | 1985-01-01 | Paper |
| Approximation schemes for the subset-sum problem: Survey and experimental analysis | 1985-01-01 | Paper |
| A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem | 1984-01-01 | Paper |
| An Algorithm for the Bottleneck Traveling Salesman Problem | 1984-01-01 | Paper |
| Balanced optimization problems | 1984-01-01 | Paper |
| Worst-case analysis of greedy algorithms for the subset-sum problem | 1984-01-01 | Paper |
| Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph | 1983-01-01 | Paper |
| Finding a minimum equivalent graph of a digraph | 1982-01-01 | Paper |
| Heuristic algorithms for the multiple knapsack problem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929530 | 1981-01-01 | Paper |
| A bound and bound algorithm for the zero-one multiple knapsack problem | 1981-01-01 | Paper |
| Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems | 1980-01-01 | Paper |
| Solution of the zero-one multiple knapsack problem | 1980-01-01 | Paper |
| Optimal and canonical solutions of the change making problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197626 | 1979-01-01 | Paper |
| An algorithm for finding a minimal equivalent graph of a strongly connected digraph | 1979-01-01 | Paper |
| Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4149228 | 1977-01-01 | Paper |
| An upper bound for the zero-one knapsack problem and a branch and bound algorithm | 1977-01-01 | Paper |
| Operational Research: Methods and Applications | N/A | Paper |
