Search Results - "K-approximation sets and functions"

A faster FPTAS for makespan minimization with time-dependent agreeable V-shaped processing times

Authors: Halman, Nir Sedding, Helmut A.

Subject Terms: Time-dependent scheduling, Monotone dynamic programming, K-approximation sets and functions, 658.5: Produktionssteuerung, 005: Computerprogrammierung, Programme und Daten, FPTAS

Strongly Polynomial FPTASes for Monotone Dynamic Programs.

Authors: Alon, Tzvi Halman, Nir

Source: Algorithmica. Oct2022, Vol. 84 Issue 10, p2785-2819. 35p.

Subject Terms: *POLYNOMIAL approximation, *POLYNOMIALS, *POLYNOMIAL time algorithms, *SET functions, *BACKPACKS, *COUNTING, *VEHICLE routing problem

Fully Polynomial Time Approximation Schemes for Robust Multistage Decision Making.

Authors: Halman, Nir Nannicini, Giacomo

Source: INFORMS Journal on Computing. Sep/Oct2025, Vol. 37 Issue 5, p1306-1327. 22p.

Subject Terms: *OPERATIONS research, *DYNAMIC programming, *INVENTORY control, *DECISION making, KNAPSACK problems, APPROXIMATION algorithms

AUTOMATIC GENERATION OF FPTASes FOR STOCHASTIC MONOTONE DYNAMIC PROGRAMS MADE EASIER.

Authors: ALON, TZVI HALMAN, NIR

Source: SIAM Journal on Discrete Mathematics. 2021, Vol. 35 Issue 4, p2679-2722. 44p.

Subject Terms: *SET functions, *OPERATIONS research, *COMPUTER science, *CALCULUS, *STOCHASTIC programming, *DYNAMIC programming

Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs.

Authors: Halman, Nir¹ (AUTHOR) halman@huji.ac.il

Source: INFORMS Journal on Computing. Fall2020, Vol. 32 Issue 4, p1157-1181. 25p.

Subject Terms: *INVENTORY control, *CUMULATIVE distribution function, *RANDOM variables, *POLYNOMIAL approximation, *SET functions, *POLYNOMIAL time algorithms, *DETERMINISTIC algorithms, *HAMILTON-Jacobi-Bellman equation

The TV advertisements scheduling problem.

Authors: Díaz-Núñez, Fabián Halman, Nir Vásquez, Óscar C.

Source: Optimization Letters; Feb2019, Vol. 13 Issue 1, p81-94, 14p

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times.

Authors: Halman, Nir

Source: Journal of Scheduling; 2020, Vol. 23 Issue 6, p643-648, 6p

Subject Terms: POLYNOMIAL approximation, POLYNOMIAL time algorithms, PRODUCTION scheduling, SET functions

Bi-criteria path problem with minimum length and maximum survival probability.

Authors: Halman, Nir Kovalyov, Mikhail Y. Quilliot, Alain et al.

Source: OR Spectrum; Jun2019, Vol. 41 Issue 2, p469-489, 21p

Subject Terms: MAXIMA & minima, MATHEMATICAL optimization, APPROXIMATION algorithms, NP-complete problems, POLYNOMIAL approximation, ARC length, POLYNOMIAL time algorithms

Fully polynomial time (Σ,Π)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs.

Authors: Halman, Nir Nannicini, Giacomo

Source: Mathematical Programming. Sep2022, Vol. 195 Issue 1/2, p183-242. 60p.

Subject Terms: *POLYNOMIAL time algorithms, *SUPPLY chain management, *COST functions, *REINFORCEMENT learning, *NONLINEAR equations, *APPROXIMATION algorithms

Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints.

Authors: Halman, Nir Kellerer, Hans Strusevich, Vitaly A.

Source: European Journal of Operational Research. Oct2018, Vol. 270 Issue 2, p435-447. 13p.

Subject Terms: *DECISION making, *INTEGER programming, BOOLEAN algebra, ALGEBRAIC logic, KNAPSACK problems

A faster FPTAS for counting two-rowed contingency tables.

Authors: Alon, Tzvi Halman, Nir

Source: Discrete Applied Mathematics. Nov2021, Vol. 303, p161-170. 10p.

Subject Terms: *CONTINGENCY tables, *POLYNOMIAL approximation, *SET functions, *POLYNOMIAL time algorithms, *COUNTING, *BARBELLS

Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks.

Authors: Halman, Nir Li, Chung-Lun Simchi-Levi, David

Source: Approximation, Randomization & Combinatorial Optimization. Algorithms & Techniques (9783540853626); 2008, p91-103, 13p

A COMPUTATIONALLY EFFICIENT FPTAS FOR CONVEX STOCHASTIC DYNAMIC PROGRAMS.

Authors: HALMAN, NIR NANNICINI, GIACOMO ORLIN, JAMES

Source: SIAM Journal on Optimization; 2015, Vol. 25 Issue 1, p317-350, 34p

Subject Terms: DYNAMIC programming, POLYNOMIALS, APPROXIMATION theory, MATHEMATICAL functions, APPROXIMATION algorithms, INVENTORY control, RANDOM variables

Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions.

Authors: Halman, Nir Wimer, Shmuel

Source: Information Processing Letters. Sep2021, Vol. 170, pN.PAG-N.PAG. 1p.

Subject Terms: *RESOURCE allocation, *COST allocation, NONLINEAR functions, POLYNOMIAL approximation, POLYNOMIAL time algorithms

A Computationally Efficient FPTAS for Convex Stochastic Dynamic Programs

Authors: Sloan School of Management Orlin, James B Halman, Nir et al.

Source: SIAM

Index Terms: Article, http://purl.org/eprint/type/JournalArticle

URL: http://hdl.handle.net/1721.1/116205
https://orcid.org/0000-0002-7488-094X
http://dx.doi.org/10.1137/13094774X
SIAM Journal on Optimization

Fully polynomial time approximation schemes (FPTAS) for some counting problems

Authors: Alon, Tzvi

Index Terms: Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/1611.00992

Knapsack problems with position-dependent item weights or profits.

Authors: Gawiejnowicz, Stanisław Halman, Nir Kellerer, Hans

Source: Annals of Operations Research; Jul2023, Vol. 326 Issue 1, p137-156, 20p

Subject Terms: KNAPSACK problems, DYNAMIC programming, PROBLEM solving, BACKPACKS, ALGORITHMS

Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle

Authors: Massachusetts Institute of Technology. Department of Civil and Environmental Engineering Sloan School of Management Orlin, James B. et al.

Source: Prof. Orlin via Alex Caracuzzo

Index Terms: Article, http://purl.org/eprint/type/JournalArticle

URL: http://hdl.handle.net/1721.1/77227
http://dx.doi.org/10.1287/opre.1110.1031
Operations Research

An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences.

Authors: Halman, Nir Vinetz, Uriel

Source: Optimization Letters; May2022, Vol. 16 Issue 4, p1181-1196, 16p

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Authors: Nir Halman

Source: Journal of Scheduling. 23:643-648

Subject Terms: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://dblp.uni-trier.de/db/journals/scheduling/scheduling23.html#Halman20
https://link.springer.com/article/10.1007/s10951-019-00616-8
https://doi.org/10.1007/s10951-019-00616-8