| Publication | Date of Publication | Type |
|---|
Oblique decision tree induction by cross-entropy optimization based on the von Mises-Fisher distribution
Computational Statistics | 2022-11-15 | Paper |
A branch \& bound algorithm to determine optimal cross-splits for decision tree induction
Annals of Mathematics and Artificial Intelligence | 2020-06-11 | Paper |
Full implementation of social choice functions in dominant strategies
International Journal of Game Theory | 2019-06-24 | Paper |
Online interval scheduling with a bounded number of failures
Journal of Scheduling | 2018-04-04 | Paper |
Complexity and approximability of the maximum flow problem with minimum quantities
Networks | 2016-06-10 | Paper |
A combined local search and integer programming approach to the traveling tournament problem
Annals of Operations Research | 2016-05-18 | Paper |
The online knapsack problem with incremental capacity
Mathematical Methods of Operations Research | 2016-05-17 | Paper |
Maximum generalized assignment with convex costs
Lecture Notes in Computer Science | 2015-10-16 | Paper |
An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
Packing items into several bins facilitates approximating the separable assignment problem
Information Processing Letters | 2015-05-21 | Paper |
An application of deterministic and robust optimization in the wood cutting industry
4OR | 2015-04-29 | Paper |
A 5.875-approximation for the traveling tournament problem
Annals of Operations Research | 2014-11-26 | Paper |
A constant factor approximation for the generalized assignment problem with minimum quantities and unit size items
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Approximation algorithms for \(\mathrm{TTP(2)}\)
Mathematical Methods of Operations Research | 2013-02-20 | Paper |
Interval scheduling on related machines
Computers & Operations Research | 2011-06-30 | Paper |
MIP Formulations for Flowshop Scheduling with Limited Buffers
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Computers & Operations Research | 2011-03-25 | Paper |
Complexity of the traveling tournament problem
Theoretical Computer Science | 2011-02-02 | Paper |
Approximating the traveling tournament problem with maximum tour length 2
Algorithms and Computation | 2010-12-09 | Paper |
New lower bounds for online \(k\)-server routing problems
Information Processing Letters | 2010-08-16 | Paper |
A note on the \(k\)-Canadian traveller problem
Information Processing Letters | 2010-04-19 | Paper |
Online Job Admission
Fundamental Problems in Computing | 2009-08-05 | Paper |
Approximation algorithms for a vehicle routing problem
Mathematical Methods of Operations Research | 2008-11-17 | Paper |
Pruning in column generation for service vehicle dispatching
Annals of Operations Research | 2008-09-03 | Paper |
A monotone approximation algorithm for scheduling with precedence constraints
Operations Research Letters | 2008-08-06 | Paper |
Online-Optimization of Large-Scale Vehicle Dispatching Problems
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Competitive Algorithms for Cottage Rental
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
