LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

DOI10.1142/S0217595909002092zbMath1188.90178OpenAlexW2044363664MaRDI QIDQ3632032

Reena Kapoor, Sant R. Arora

Publication date: 23 June 2009

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595909002092

zbMATH Keywords

quadratic programminglinearizationfractional programmingNP-hard0-1 programming

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32)

Related Items (1)

A geometric branch-and-bound algorithm for the service bundle design problem

Cites Work

• Unnamed Item
• A new linearization technique for multi-quadratic 0-1 programming problems.
• Fractional programming: Applications and algorithms
• Complexity of uniqueness and local search in quadratic 0-1 programming
• A note on a global approach for general 0-1 fractional programming
• A global approach for general \(0-1\) fractional programming
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Programming with linear fractional functionals
• On the polynomial mixed 0-1 fractional programming problems

This page was built for publication: LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM