| Publication | Date of Publication | Type |
|---|
Packing squares independently
Theoretical Computer Science | 2024-12-12 | Paper |
Knapsack problems with position-dependent item weights or profits
Annals of Operations Research | 2023-07-31 | Paper |
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
4OR | 2023-06-07 | Paper |
Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs
Mathematical Programming. Series A. Series B | 2022-10-24 | Paper |
Strongly polynomial FPTASes for monotone dynamic programs
Algorithmica | 2022-10-06 | Paper |
An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
Optimization Letters | 2022-04-22 | Paper |
Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
SIAM Journal on Discrete Mathematics | 2021-12-01 | Paper |
A faster FPTAS for counting two-rowed contingency tables
Discrete Applied Mathematics | 2021-09-15 | Paper |
Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
Information Processing Letters | 2021-06-16 | Paper |
Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs
INFORMS Journal on Computing | 2021-02-01 | Paper |
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times
Journal of Scheduling | 2020-12-11 | Paper |
An FPTAS for the knapsack problem with parametric weights
Operations Research Letters | 2020-02-10 | Paper |
Bi-criteria path problem with minimum length and maximum survival probability
OR Spectrum | 2020-01-15 | Paper |
Toward breaking the curse of dimensionality: an FPTAS for stochastic dynamic programs with multidimensional actions and scalar states
SIAM Journal on Optimization | 2019-05-07 | Paper |
The TV advertisements scheduling problem
Optimization Letters | 2019-03-21 | Paper |
On the complexity of energy storage problems
Discrete Optimization | 2018-08-17 | Paper |
Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
European Journal of Operational Research | 2018-07-12 | Paper |
Approximating convex functions via non-convex oracles under the relative noise model
Discrete Optimization | 2018-05-24 | Paper |
scientific article; zbMATH DE number 6861894 (Why is no real title available?)
| 2018-04-19 | Paper |
A computationally efficient FPTAS for convex stochastic dynamic programs
SIAM Journal on Optimization | 2017-01-13 | Paper |
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
Theoretical Computer Science | 2016-08-31 | Paper |
Fully polynomial time approximation schemes for stochastic dynamic programs
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Approximating the nonlinear newsvendor and single-item stochastic lot-sizing problems when data is given by an oracle
Operations Research | 2012-10-01 | Paper |
A fully polynomial-time approximation scheme for single-item stochastic inventory control with discrete demand
Mathematics of Operations Research | 2011-04-27 | Paper |
scientific article; zbMATH DE number 5764859 (Why is no real title available?)
| 2010-08-06 | Paper |
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks
Operations Research Letters | 2009-08-14 | Paper |
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Information Processing Letters | 2009-03-23 | Paper |
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
SIAM Journal on Computing | 2009-03-16 | Paper |
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Discrete and lexicographic Helly-type theorems
Discrete & Computational Geometry | 2008-08-19 | Paper |
Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
Algorithmica | 2007-11-28 | Paper |
The convex dimension of a graph
Discrete Applied Mathematics | 2007-07-19 | Paper |
One-way and round-trip center location problems
Discrete Optimization | 2005-10-10 | Paper |
Continuous bottleneck tree partitioning problems
Discrete Applied Mathematics | 2004-08-06 | Paper |
