scientific article; zbMATH DE number 7310231

MaRDI QIDQ5150606

Roman E. Shangin

Publication date: 15 February 2021

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

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

zbMATH Keywords

dynamic programmingcycleWeber problemexact algorithm

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Optimal location of branching points of a transportation network on a digital model of a region
• Polynomial algorithms to finite Veber problem for a tree network
• The quadratic assignment problem. I: New lower bounds in paired assignment
• The optimal distribution of a tree in a finite set
• Effective algorithm for the weber problem with a rectangular metric

Related Items (2)

Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Unnamed Item

Uses Software

• CPLEX

This page was built for publication: