default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Goldberg
Person information
- affiliation: Bar-Ilan University, Ramat Gan, Israel
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Noam Goldberg, Isaac Meilijson
, Yael Perlman:
Dynamic history-dependent tax and environmental compliance monitoring of risk-averse firms. Ann. Oper. Res. 334(1): 469-495 (2024)- [i2]Noam Goldberg, Mark P. Langer, Shimrit Shtern:
Robust Radiotherapy Planning with Spatially Based Uncertainty Sets. CoRR abs/2402.17040 (2024) - 2022
- [j17]Noam Goldberg, Michael Poss:
Linearized formulations for failure aware barter exchange. Optim. Lett. 16(4): 1301-1313 (2022) - [j16]Marin Bougeret, György Dósa, Noam Goldberg, Michael Poss:
Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty. SIAM J. Discret. Math. 36(4): 2534-2552 (2022) - 2021
- [j15]Noam Goldberg, Steffen Rebennack, Youngdae Kim, Vitaliy Krasko, Sven Leyffer:
MINLP formulations for continuous piecewise linear function fitting. Comput. Optim. Appl. 79(1): 223-233 (2021) - 2020
- [j14]Noam Goldberg, Gábor Rudolf:
On the complexity and approximation of the maximum expected value all-or-nothing subset. Discret. Appl. Math. 283: 1-10 (2020) - [j13]Noam Goldberg, Michael Poss:
Maximum probabilistic all-or-nothing paths. Eur. J. Oper. Res. 283(1): 279-289 (2020)
2010 – 2019
- 2019
- [j12]Yael Deutsch, Noam Goldberg, Yael Perlman:
Incorporating monitoring technology and on-site inspections into an n-person inspection game. Eur. J. Oper. Res. 274(2): 627-637 (2019) - [j11]Noam Goldberg, Shlomo Karhi:
Online packing of arbitrary sized items into designated and multipurpose bins. Eur. J. Oper. Res. 279(1): 54-67 (2019) - [j10]Jonathan Eckstein, Ai Kagawa, Noam Goldberg:
REPR: Rule-Enhanced Penalized Regression. INFORMS J. Optim. 1(2): 143-163 (2019) - [c7]Aniket Basu Roy, Marin Bougeret, Noam Goldberg, Michael Poss:
Approximating Robust Bin Packing with Budgeted Uncertainty. WADS 2019: 71-84 - [c6]Noam Goldberg, Ishy Zagdoun:
Sparsity and Performance Enhanced Markowitz Portfolios Using Second-Order Cone Programming. WCGO 2019: 871-881 - 2017
- [j9]Hyun-Seob Song, Noam Goldberg, Ashutosh Mahajan, Doraiswami Ramkrishna:
Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming. Bioinform. 33(15): 2345-2353 (2017) - [j8]Boaz Golany, Noam Goldberg, Uriel G. Rothblum:
A two-resource allocation algorithm with an application to large-scale zero-sum defensive games. Comput. Oper. Res. 78: 218-229 (2017) - [c5]Jonathan Eckstein, Noam Goldberg, Ai Kagawa:
Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement. ICML 2017: 1059-1067 - [i1]Noam Goldberg, Gábor Rudolf:
On the Complexity and Approximation of the Maximum Expected Value All-or-Nothing Subset. CoRR abs/1706.07406 (2017) - 2015
- [j7]Boaz Golany, Noam Goldberg, Uriel G. Rothblum:
Allocating multiple defensive resources in a zero-sum game setting. Ann. Oper. Res. 225(1): 91-109 (2015) - [j6]Noam Goldberg, Sven Leyffer, Ilya Safro:
Optimal response to epidemics and cyber attacks in networks. Networks 66(2): 145-158 (2015) - [j5]Noam Goldberg, Sven Leyffer:
An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming. SIAM J. Optim. 25(3): 1455-1477 (2015) - 2014
- [j4]Noam Goldberg, Youngdae Kim, Sven Leyffer, Thomas D. Veselka:
Adaptively refined dynamic program for linear spline regression. Comput. Optim. Appl. 58(3): 523-541 (2014) - 2013
- [c4]Noam Goldberg, Sven Leyffer, Todd S. Munson:
A New Perspective on Convex Relaxations of Sparse SVM. SDM 2013: 450-457 - 2012
- [j3]Jonathan Eckstein, Noam Goldberg:
An Improved Branch-and-Bound Method for Maximum Monomial Agreement. INFORMS J. Comput. 24(2): 328-341 (2012) - [j2]Noam Goldberg, Jonathan Eckstein:
Sparse weighted voting classifier selection and its linear programming relaxations. Inf. Process. Lett. 112(12): 481-486 (2012) - [c3]Ossama Younis, Andrei Ghetie, Sharanya Eswaran, Noam Goldberg, Sunil Samtani, Maneesh Varshney, Mitesh P. Patel:
A framework for evaluating network optimization techniques. Sarnoff Symposium 2012: 1-5 - 2011
- [j1]Endre Boros, Noam Goldberg, Paul B. Kantor, Jonathan Word:
Optimal sequential inspection policies. Ann. Oper. Res. 187(1): 89-119 (2011) - 2010
- [c2]Noam Goldberg, Jonathan Eckstein:
Boosting Classifiers with Tightened L0-Relaxation Penalties. ICML 2010: 383-390
2000 – 2009
- 2007
- [c1]Noam Goldberg, Chung-chieh Shan:
Boosting Optimal Logical Patterns Using Noisy Data. SDM 2007: 228-236
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
