scientific article; zbMATH DE number 1263277

From MaRDI portal

Revision as of 15:27, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4234150

Jump to:navigation, search

zbMath0924.90125MaRDI QIDQ4234150

Denis Naddef, Jean-Maurice Clochard

Publication date: 2 November 1999

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

zbMATH Keywords

branch-and-bound polytope branch-and-cut large traveling salesman

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06)

Related Items (4)

Branching rules revisited ⋮ The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization ⋮ Certification of an optimal TSP tour through 85,900 cities ⋮ The rural postman problem with deadline classes

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4234150&oldid=18113271"