scientific article; zbMATH DE number 1264411
From MaRDI portal
Publication:4233343
zbMATH Open0916.90098MaRDI QIDQ4233343
Publication date: 16 March 1999
Title of this publication is not available (Why is that?)
Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (2)
Some polynomially solvable subcases of the detailed routing problem in VLSI design ⋮ VLSI routing in polynomial time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233343)