Nelson A. Uhan

Orcid: 0000-0001-5574-6561

According to our database1, Nelson A. Uhan authored at least 21 papers between 2007 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Approximating a linear multiplicative objective in watershed management optimization.
Eur. J. Oper. Res., 2023

2022
Acyclic Mechanism Design for Freight Consolidation.
Transp. Sci., 2022

Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner.
Oper. Res. Lett., 2022

2021
Equilibrium strategies for multiple interdictors on a common network.
Eur. J. Oper. Res., 2021

2017
Dynamic linear programming games with risk-averse players.
Math. Program., 2017

2016
Scheduling on a single machine under time-of-use electricity tariffs.
Ann. Oper. Res., 2016

2015
Stochastic linear programming games with concave preferences.
Eur. J. Oper. Res., 2015

2014
The complexity of egalitarian mechanisms for linear programming games.
Oper. Res. Lett., 2014

Dynamic cost allocation for economic lot sizing games.
Oper. Res. Lett., 2014

POETIC: Interactive solutions to alleviate the reversal error in student-professor type problems.
Int. J. Hum. Comput. Stud., 2014

2013
Technical Note - On Traveling Salesman Games with Asymmetric Costs.
Oper. Res., 2013

Approximating the least core value and least core of cooperative games with supermodular costs.
Discret. Optim., 2013

Flow shop scheduling with peak power consumption constraints.
Ann. Oper. Res., 2013

2012
A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games.
Oper. Res. Lett., 2012

The Impact of Group Purchasing Organizations on Healthcare-Product Supply Chains.
Manuf. Serv. Oper. Manag., 2012

Cost-sharing mechanisms for scheduling under general demand settings.
Eur. J. Oper. Res., 2012

2011
Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling.
Math. Oper. Res., 2011

2010
Minimizing the sum of weighted completion times in a concurrent open shop.
Oper. Res. Lett., 2010

The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability.
Oper. Res. Lett., 2010

Sharing Supermodular Costs.
Oper. Res., 2010

2007
Encouraging Cooperation in Sharing Supermodular Costs.
Proceedings of the Approximation, 2007


  Loading...