Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations
DOI10.1007/s10559-007-0109-8zbMath1142.91380OpenAlexW1978355214MaRDI QIDQ941198
Publication date: 4 September 2008
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-007-0109-8
combinatorial optimizationlinear programming methodsantagonistic gamemodified graphical methodoptimization problem on permutationsvalue of game
Linear programming (90C05) Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06) Other game-theoretic models (91A40) Combinatorial games (91A46)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving linear optimization problems on arrangements by the truncation method
- A modification of the method of combinatorial truncation in optimization problems over vertex-located sets
- Construction of convex continuations for functions defined on a hypersphere
- A mathematical interval model of a combinatorial problem of packing of color rectangles
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- Solution of optimization problems with fractional-linear objective functions and additional linear constraints on permutations
This page was built for publication: Analysis of mathematical models and methods of solving combinatorial optimization problems on game-type permutations