Lower and upper bounds for linear production games
From MaRDI portal
Publication:1027527
DOI10.1016/j.ejor.2008.03.020zbMath1163.90450OpenAlexW2030400787MaRDI QIDQ1027527
Endre Bjørndal, Kurt O. Jørnsten
Publication date: 30 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.03.020
Related Items (2)
Efficient computation of the Shapley value for large-scale linear production games ⋮ A preemptive goal programming for multi‐objective cooperative games: an application to multi‐objective linear production
Cites Work
- On balanced games and games with committee control
- Characterization of the Owen set of linear production processes
- A generalized linear production model: A unifying model
- Bounds on the Effect of Aggregating Variables in Linear Programs
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- Bounds for Row-Aggregation in Linear Programming
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- On the core of linear production games
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
This page was built for publication: Lower and upper bounds for linear production games