default search action
Nelson A. Uhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Ashley N. Boddiford, Daniel E. Kaufman
, Daphne E. Skipper, Nelson A. Uhan:
Approximating a linear multiplicative objective in watershed management optimization. Eur. J. Oper. Res. 305(2): 547-561 (2023) - 2022
- [j19]George Gilliam, Nelson A. Uhan
Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner. Oper. Res. Lett. 50(1): 64-71 (2022) - [j18]Wentao Zhang, Nelson A. Uhan
Acyclic Mechanism Design for Freight Consolidation. Transp. Sci. 56(3): 571-584 (2022) - 2021
- [j17]Harikrishnan Sreekumaran, Ashish Ranjan Hota
Equilibrium strategies for multiple interdictors on a common network. Eur. J. Oper. Res. 288(2): 523-538 (2021)
2010 – 2019
- 2017
- [j16]Alejandro Toriello
Dynamic linear programming games with risk-averse players. Math. Program. 163(1-2): 25-56 (2017) - 2016
- [j15]Kan Fang
Scheduling on a single machine under time-of-use electricity tariffs. Ann. Oper. Res. 238(1-2): 199-227 (2016) - 2015
- [j14]Nelson A. Uhan:
Stochastic linear programming games with concave preferences. Eur. J. Oper. Res. 243(2): 637-646 (2015) - 2014
- [j13]Sung-Hee Kim, Daniel Phang, Tuyin An, Ji Soo Yi, Rachael Kenney, Nelson A. Uhan:
POETIC: Interactive solutions to alleviate the reversal error in student-professor type problems. Int. J. Hum. Comput. Stud. 72(1): 12-22 (2014) - [j12]Nelson A. Uhan:
The complexity of egalitarian mechanisms for linear programming games. Oper. Res. Lett. 42(1): 76-81 (2014) - [j11]Alejandro Toriello
Dynamic cost allocation for economic lot sizing games. Oper. Res. Lett. 42(1): 82-84 (2014) - 2013
- [j10]Kan Fang
Flow shop scheduling with peak power consumption constraints. Ann. Oper. Res. 206(1): 115-145 (2013) - [j9]Andreas S. Schulz, Nelson A. Uhan:
Approximating the least core value and least core of cooperative games with supermodular costs. Discret. Optim. 10(2): 163-180 (2013) - [j8]Alejandro Toriello
Technical Note - On Traveling Salesman Games with Asymmetric Costs. Oper. Res. 61(6): 1429-1434 (2013) - 2012
- [j7]Sindhura Balireddi, Nelson A. Uhan:
Cost-sharing mechanisms for scheduling under general demand settings. Eur. J. Oper. Res. 217(2): 270-277 (2012) - [j6]Qiaohai (Joice) Hu
The Impact of Group Purchasing Organizations on Healthcare-Product Supply Chains. Manuf. Serv. Oper. Manag. 14(1): 7-23 (2012) - [j5]Mohan Gopaladesikan, Nelson A. Uhan, Jikai Zou:
A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games. Oper. Res. Lett. 40(6): 453-458 (2012) - 2011
- [j4]Andreas S. Schulz, Nelson A. Uhan:
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling. Math. Oper. Res. 36(1): 14-23 (2011) - 2010
- [j3]Andreas S. Schulz, Nelson A. Uhan:
Sharing Supermodular Costs. Oper. Res. 58(4-Part-2): 1051-1056 (2010) - [j2]Douglas S. Altner, Özlem Ergun, Nelson A. Uhan:
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. Oper. Res. Lett. 38(1): 33-38 (2010) - [j1]Monaldo Mastrolilli
Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5): 390-395 (2010)
2000 – 2009
- 2009
- [i1]Andreas S. Schulz, Nelson A. Uhan:
Sharing Supermodular Costs. Models and Algorithms for Optimization in Logistics 2009 - 2007
- [c1]Andreas S. Schulz, Nelson A. Uhan:
Encouraging Cooperation in Sharing Supermodular Costs. APPROX-RANDOM 2007: 271-285
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-04-25 05:48 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: