scientific article; zbMATH DE number 1982172
From MaRDI portal
Publication:4426341
zbMath1023.90529MaRDI QIDQ4426341
Ernst Althaus, Tobias Polzin, Siavash Vahdati Daneshmand
Publication date: 16 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2647/26470001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)
Related Items (7)
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ Local cuts for mixed-integer programming ⋮ A branch-and-cut algorithm for the Steiner tree problem with delays ⋮ Solving the quorumcast routing problem by constraint programming ⋮ The Steiner tree problem with delays: a compact formulation and reduction procedures ⋮ Local cuts revisited ⋮ Approaches to the Steiner Problem in Networks
Uses Software
This page was built for publication:
