scientific article; zbMATH DE number 7092126

zbMath1497.90186MaRDI QIDQ5228569

Gennady Grigorjevich Zabudsky

Publication date: 12 August 2019

Full work available at URL: http://mathnet.ru/eng/ivm1136

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Optimization of location of interconnected facilities on parallel lines with forbidden zones

Cites Work

• Algorithm for solving a problem on optimal linear ordering
• On the One-Dimensional Space Allocation Problem
• P-Complete Approximation Problems

This page was built for publication: