| Publication | Date of Publication | Type |
|---|
Flow shop scheduling with inter-stage flexibility and blocking constraints
Computers & Operations Research | 2025-12-02 | Paper |
| Worst-case analysis for on-line data compression | 2024-07-05 | Paper |
Fair allocation algorithms for indivisible items under structured conflict constraints
Computational and Applied Mathematics | 2023-10-02 | Paper |
Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
Journal of Scheduling | 2023-07-13 | Paper |
Corrigendum to: ``Integer optimization with penalized fractional values: the knapsack case''
European Journal of Operational Research | 2023-07-04 | Paper |
One-dimensional stock cutting resilient against singular random defects
Computers & Operations Research | 2023-07-03 | Paper |
Approximating single- and multi-objective nonlinear sum and product knapsack problems
Discrete Optimization | 2023-06-30 | Paper |
Allocation of indivisible items with individual preference graphs
Discrete Applied Mathematics | 2023-05-11 | Paper |
Fair allocation of indivisible items with conflict graphs
Algorithmica | 2023-04-28 | Paper |
Allocating indivisible items with minimum dissatisfaction on preference graphs
(available as arXiv preprint) | 2023-03-31 | Paper |
Fair Packing of Independent Sets
Lecture Notes in Computer Science | 2022-10-13 | Paper |
The random linear bottleneck assignment problem
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Optimally rescheduling jobs with a last-in-first-out buffer
Journal of Scheduling | 2022-01-14 | Paper |
Approximating the product knapsack problem
Optimization Letters | 2021-09-28 | Paper |
On the Stackelberg knapsack game
European Journal of Operational Research | 2021-06-04 | Paper |
Integer programming models versus advanced planning business software for a multi-level mixed-model assembly line problem
CEJOR. Central European Journal of Operations Research | 2020-09-29 | Paper |
Fair allocation of indivisible items with conflict graphs
(available as arXiv preprint) | 2020-03-25 | Paper |
A Stackelberg knapsack game with weight control
Theoretical Computer Science | 2019-11-13 | Paper |
Geometric and LP-based heuristics for angular travelling salesman problems in the plane
Computers & Operations Research | 2019-07-08 | Paper |
On approximating the incremental knapsack problem
Discrete Applied Mathematics | 2019-06-20 | Paper |
Approximating the 3-period incremental knapsack problem
Journal of Discrete Algorithms | 2019-01-18 | Paper |
New exact approaches and approximation results for the penalized knapsack problem
Discrete Applied Mathematics | 2018-12-18 | Paper |
Integer optimization with penalized fractional values: the knapsack case
European Journal of Operational Research | 2018-12-06 | Paper |
| Approximation results for the incremental knapsack problem | 2018-06-15 | Paper |
Price of fairness for allocating a bounded resource
European Journal of Operational Research | 2018-05-24 | Paper |
Improved dynamic programming and approximation results for the knapsack problem with setups
International Transactions in Operational Research | 2018-05-22 | Paper |
Competitive multi-agent scheduling with an iterative selection rule
4OR | 2018-04-13 | Paper |
| The core concept for the Multidimensional Knapsack problem | 2018-04-12 | Paper |
Personnel planning with multi-tasking and structured qualifications
Operations Research Proceedings | 2017-12-01 | Paper |
The shortest connection game
Discrete Applied Mathematics | 2017-09-12 | Paper |
Approximation of knapsack problems with conflict and forcing graphs
Journal of Combinatorial Optimization | 2017-08-03 | Paper |
Minimization and maximization versions of the quadratic travelling salesman problem
Optimization | 2017-07-12 | Paper |
Generating subtour elimination constraints for the TSP from pure integer solutions
CEJOR. Central European Journal of Operations Research | 2017-06-21 | Paper |
| Maximin fairness in project budget allocation | 2017-02-14 | Paper |
| Linear models and computational experiments for the quadratic TSP | 2017-02-14 | Paper |
On the shortest path game
Discrete Applied Mathematics | 2016-12-22 | Paper |
Exact solution of the robust knapsack problem
Computers & Operations Research | 2016-11-10 | Paper |
Approximation of the quadratic knapsack problem
INFORMS Journal on Computing | 2016-08-12 | Paper |
The Subset Sum game
European Journal of Operational Research | 2016-06-24 | Paper |
Scheduling two agent task chains with a central selection mechanism
Journal of Scheduling | 2015-07-28 | Paper |
Two agent scheduling with a central selection mechanism
Theoretical Computer Science | 2015-07-24 | Paper |
The shortest path game: complexity and algorithms
Advanced Information Systems Engineering | 2014-09-15 | Paper |
The shortest path game: complexity and algorithms
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Approximating the quadratic knapsack problem on special graph classes
Approximation and Online Algorithms | 2014-09-02 | Paper |
On the robust knapsack problem
SIAM Journal on Optimization | 2014-04-09 | Paper |
Two agents competing for a shared machine
Algorithmic Decision Theory | 2013-12-17 | Paper |
A two-period portfolio selection model for Asset-Backed Securitization
Algorithmic Operations Research | 2013-12-11 | Paper |
Strategies in competing subset selection
Annals of Operations Research | 2013-09-16 | Paper |
The maximum flow problem with disjunctive constraints
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
Committee selection under weight constraints
Mathematical Social Sciences | 2012-09-11 | Paper |
The multidimensional knapsack problem: structure and algorithms
INFORMS Journal on Computing | 2012-07-28 | Paper |
Approximating multiobjective knapsack problems
Management Science | 2012-02-19 | Paper |
Competitive subset selection with two agents
Discrete Applied Mathematics | 2011-10-27 | Paper |
Paths, trees and matchings under disjunctive constraints
Discrete Applied Mathematics | 2011-10-27 | Paper |
The maximum flow problem with conflict and forcing conditions
Lecture Notes in Computer Science | 2011-09-09 | Paper |
ILP models for a nurse scheduling problem
Operations Research Proceedings | 2011-04-07 | Paper |
A multi-commodity flow approach for the design of the last mile in real-world fiber optic networks
Operations Research Proceedings | 2011-04-07 | Paper |
Finding socially best spanning treesî
Theory and Decision | 2011-04-05 | Paper |
Resource allocation with time intervals
Theoretical Computer Science | 2010-11-19 | Paper |
A note on maximizing the minimum voter satisfaction on spanning trees
Mathematical Social Sciences | 2010-09-07 | Paper |
The fractional prize-collecting Steiner tree problem on trees (extended abstract)
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Modified subset sum heuristics for bin packing
Information Processing Letters | 2009-12-18 | Paper |
Inverse 1-center location problems with edge length augmentation on trees
Computing | 2009-12-11 | Paper |
Determining a Minimum Spanning Tree with Disjunctive Constraints
Algorithmic Decision Theory | 2009-11-17 | Paper |
Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals
Algorithmic Decision Theory | 2009-11-17 | Paper |
Subset Weight Maximization with Two Competing Agents
Algorithmic Decision Theory | 2009-11-17 | Paper |
The Knapsack Problem with Conflict Graphs
Journal of Graph Algorithms and Applications | 2009-10-21 | Paper |
Maximizing the minimum voter satisfaction on spanning trees
Mathematical Social Sciences | 2009-10-15 | Paper |
The traveling group problem
Social Choice and Welfare | 2007-10-11 | Paper |
An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
Improved dynamic programming in connection with an FPTAS for the knapsack problem
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
Securitization of financial assets: approximation in theory and practice
Computational Optimization and Applications | 2005-01-17 | Paper |
| scientific article; zbMATH DE number 2107164 (Why is no real title available?) | 2004-10-12 | Paper |
Approximation schemes for ordered vector packing problems
Naval Research Logistics | 2004-03-15 | Paper |
Worst-case analysis of the subset sum algorithm for bin packing.
Operations Research Letters | 2004-01-05 | Paper |
A 3/4-approximation algorithm for multiple subset sum
Journal of Heuristics | 2003-08-28 | Paper |
An efficient fully polynomial approximation scheme for the Subset-Sum problem.
Journal of Computer and System Sciences | 2003-08-13 | Paper |
| scientific article; zbMATH DE number 1833403 (Why is no real title available?) | 2002-11-21 | Paper |
| scientific article; zbMATH DE number 1830735 (Why is no real title available?) | 2002-11-18 | Paper |
A PTAS for the multiple subset sum problem with different knapsack capacities
Information Processing Letters | 2002-07-25 | Paper |
The multiple subset sum problem
SIAM Journal on Optimization | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1482229 (Why is no real title available?) | 2000-07-27 | Paper |
Approximation algorithms for knapsack problems with cardinality constraints
European Journal of Operational Research | 2000-07-09 | Paper |
Dynamic programming revisited: Improving knapsack algorithms
Computing | 2000-03-16 | Paper |
Cardinality constrained bin-packing problems
Annals of Operations Research | 2000-01-11 | Paper |
Stochastic analysis of greedy algorithms for the subset sum problem
CEJOR. Central European Journal of Operations Research | 1999-11-08 | Paper |
A new fully polynomial time approximation scheme for the Knapsack problem
Journal of Combinatorial Optimization | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1264460 (Why is no real title available?) | 1999-07-21 | Paper |
| scientific article; zbMATH DE number 1202323 (Why is no real title available?) | 1998-09-24 | Paper |
Greedy Algorithms for On-Line Data Compression
Journal of Algorithms | 1998-09-08 | Paper |
| scientific article; zbMATH DE number 1182767 (Why is no real title available?) | 1998-08-02 | Paper |
The inverse-parametric knapsack problem
European Journal of Operational Research | 1998-06-11 | Paper |
Solution methods and computational investigations for the linear bottleneck assignment problem
Computing | 1998-02-04 | Paper |
| scientific article; zbMATH DE number 1104339 (Why is no real title available?) | 1998-01-14 | Paper |
Simple but efficient approaches for the collapsing knapsack problem
Discrete Applied Mathematics | 1997-09-04 | Paper |
| scientific article; zbMATH DE number 995809 (Why is no real title available?) | 1997-04-01 | Paper |
The random linear bottleneck assignment problem
RAIRO - Operations Research | 1997-01-07 | Paper |
The fractional greedy algorithm for data compression
Computing | 1996-08-05 | Paper |
| scientific article; zbMATH DE number 764405 (Why is no real title available?) | 1995-07-25 | Paper |
Monge matrices make maximization manageable
Operations Research Letters | 1995-05-28 | Paper |
| scientific article; zbMATH DE number 672025 (Why is no real title available?) | 1994-11-08 | Paper |
Linear programs with an additional rank two reverse convex constraint
Journal of Global Optimization | 1994-06-19 | Paper |
Operational Research: Methods and Applications
(available as arXiv preprint) | N/A | Paper |
