A Class of Nonlinear Integer Programs Solvable by a Single Linear Program

DOI10.1137/0315059zbMATH Open0374.90049OpenAlexW2007126746MaRDI QIDQ4152034FDOQ4152034

Authors: Robert R. Meyer 

Publication date: 1977

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/57976

Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30) Integer programming (90C10)

Cited In (6)

• Optimal \((0, 1)\)-matrix completion with majorization ordered objectives
• Solution techniques for some allocation problems
• Computation and efficiency of potential function minimizers of combinatorial congestion games
• Subdeterminants and concave integer quadratic programming
• Reduction of nonlinear integer separable programming problems^∗
• Computational aspects of two-segment separable programming

This page was built for publication: A Class of Nonlinear Integer Programs Solvable by a Single Linear Program

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152034)