scientific article; zbMATH DE number 3356508
From MaRDI portal
Publication:5630873
Cited in
(9)- Implementation of successive linear programming algorithms for non-convex goal programming
- Successive linear programming for ratio goal problems
- Complements, mollifiers and the propensity to disrupt
- Domination structures and multicriteria problems in N-person games
- On a cost allocation problem arising from a capacitated concentrator covering problem
- The least square prenucleolus and the least square nucleolus. Two values for TU games based on the excess vector
- On the core and nucleolus of minimum cost spanning tree games
- Onn-person game solutions and convex programs with essentially unconstrained duals1
- Some recent results inn-person game theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5630873)
