Noam Goldberg

Orcid: 0000-0002-1340-7569

Affiliations:
  • Bar-Ilan University, Ramat Gan, Israel


According to our database1, Noam Goldberg authored at least 26 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Dynamic history-dependent tax and environmental compliance monitoring of risk-averse firms.
Ann. Oper. Res., March, 2024

Robust Radiotherapy Planning with Spatially Based Uncertainty Sets.
CoRR, 2024

2022
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty.
SIAM J. Discret. Math., 2022

Linearized formulations for failure aware barter exchange.
Optim. Lett., 2022

2021
MINLP formulations for continuous piecewise linear function fitting.
Comput. Optim. Appl., 2021

2020
Maximum probabilistic all-or-nothing paths.
Eur. J. Oper. Res., 2020

On the complexity and approximation of the maximum expected value all-or-nothing subset.
Discret. Appl. Math., 2020

2019
REPR: Rule-Enhanced Penalized Regression.
INFORMS J. Optim., April, 2019

Online packing of arbitrary sized items into designated and multipurpose bins.
Eur. J. Oper. Res., 2019

Incorporating monitoring technology and on-site inspections into an <i>n</i>-person inspection game.
Eur. J. Oper. Res., 2019

Sparsity and Performance Enhanced Markowitz Portfolios Using Second-Order Cone Programming.
Proceedings of the Optimization of Complex Systems: Theory, 2019

Approximating Robust Bin Packing with Budgeted Uncertainty.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2017
A two-resource allocation algorithm with an application to large-scale zero-sum defensive games.
Comput. Oper. Res., 2017

Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming.
Bioinform., 2017

Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement.
Proceedings of the 34th International Conference on Machine Learning, 2017

2015
An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming.
SIAM J. Optim., 2015

Optimal response to epidemics and cyber attacks in networks.
Networks, 2015

Allocating multiple defensive resources in a zero-sum game setting.
Ann. Oper. Res., 2015

2014
Adaptively refined dynamic program for linear spline regression.
Comput. Optim. Appl., 2014

2013
A New Perspective on Convex Relaxations of Sparse SVM.
Proceedings of the 13th SIAM International Conference on Data Mining, 2013

2012
Sparse weighted voting classifier selection and its linear programming relaxations.
Inf. Process. Lett., 2012

An Improved Branch-and-Bound Method for Maximum Monomial Agreement.
INFORMS J. Comput., 2012

A framework for evaluating network optimization techniques.
Proceedings of the 35th IEEE Sarnoff Symposium 2012, Newark, NJ, USA, May 21-22, 2012, 2012

2011
Optimal sequential inspection policies.
Ann. Oper. Res., 2011

2010
Boosting Classifiers with Tightened L0-Relaxation Penalties.
Proceedings of the 27th International Conference on Machine Learning (ICML-10), 2010

2007
Boosting Optimal Logical Patterns Using Noisy Data.
Proceedings of the Seventh SIAM International Conference on Data Mining, 2007


  Loading...