scientific article; zbMATH DE number 3616187

zbMATH Open0396.90062MaRDI QIDQ4180137FDOQ4180137

Authors: J.-C. Panayiotopoulos 

Publication date: 1978

Title of this publication is not available (Why is that?)

zbMATH Keywords

Assignment ProblemComputational ComplexitySet-Covering ProblemThree-Dimensional Space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial aspects of packing and covering (05B40)

Cited In (2)

• New lower bounds for the triplanar assignment problem. Use of the classical model
• The three-dimensional assignment and partition problems. New lower bounds

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 Q4180137)