Coloring games with multi-located players
From MaRDI portal
Cites work
- A generalized linear production model: A unifying model
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Chinese postman games with multi-located players
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Core Stability of Minimum Coloring Games
- Economic lot-sizing games
- Fair cost allocations under conflicts - a game-theoretic point of view -
- Family sequencing and cooperation
- Fixed tree games with multilocated players
- scientific article; zbMATH DE number 1599890 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- Minimum coloring problems with weakly perfect graphs
- Monotonic stable solutions for minimum coloring games
- On a new class of parallel sequencing situations and related games
- On the core of multiple longest traveling salesman games
- On the properties of weighted minimum colouring games
- Operations research games: A survey. (With comments and rejoinder)
- Production-inventory games: A new class of totally balanced combinatorial optimization games
- Simple and three-valued simple minimum coloring games
- Submodularity of some classes of the combinatorial optimization games
- The strong perfect graph theorem
- Totally balanced combinatorial optimization games
This page was built for publication: Coloring games with multi-located players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7257398)
