The following pages link to Nelson A. Uhan (Q271936):
Displaying 18 items.
- Scheduling on a single machine under time-of-use electricity tariffs (Q271939) (← links)
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- Flow shop scheduling with peak power consumption constraints (Q363556) (← links)
- Cost-sharing mechanisms for scheduling under general demand settings (Q439369) (← links)
- Dynamic linear programming games with risk-averse players (Q526824) (← links)
- Minimizing the sum of weighted completion times in a concurrent open shop (Q613333) (← links)
- The complexity of egalitarian mechanisms for linear programming games (Q1667178) (← links)
- Dynamic cost allocation for economic lot sizing games (Q1667179) (← links)
- A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games (Q1939686) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability (Q2270321) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- Sharing Supermodular Costs (Q3098296) (← links)
- Near-Optimal Solutions and Large Integrality Gaps for Almost All Instances of Single-Machine Precedence-Constrained Scheduling (Q3169127) (← links)
- Encouraging Cooperation in Sharing Supermodular Costs (Q3603471) (← links)
- Technical Note—On Traveling Salesman Games with Asymmetric Costs (Q5166292) (← links)
