Complexity of a class of nonlinear combinatorial problems related to their linear counterparts

DOI10.1016/0377-2217(94)90254-2zbMath0805.90081OpenAlexW2017053537MaRDI QIDQ1328652

Suresh P. Sethi, Wiesław X. Kubiak

Publication date: 26 July 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90254-2

zbMATH Keywords

NP-hardlinear combinatorial problems

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completion time variance minimization on a single machine is difficult

This page was built for publication: Complexity of a class of nonlinear combinatorial problems related to their linear counterparts