Games with combinatorial constraints
From MaRDI portal
Publication:1008310
DOI10.1007/s10559-008-9028-6zbMath1158.91332OpenAlexW1985693255MaRDI QIDQ1008310
Publication date: 27 March 2009
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-008-9028-6
Related Items
Numerical solution of special matrix games ⋮ Proving the convergence of the iterative method for solving a game-type combinatorial optimization problem on arrangements ⋮ Solving a linear problem of Euclidean combinatorial optimization on arrangements with the constant sum of the elements
Cites Work
- 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
- Solution of a Euclidean combinatorial optimization problem by the dynamic-programming method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item