Search Results - "Nayak, Rupaj Kumar"

Improved row-by-row method for binary quadratic optimization problems by Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar

“…The research presented here is an improved row-by-row (RBR) algorithm for the solution of boolean quadratic programming (BQP) problems. While a faster and…”
Get full text

Solution of boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation by Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar

“…Many combinatorial optimization problems and engineering problems can be modeled as boolean quadratic programming (BQP) problems. In this paper, two augmented…”
Get full text

A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem by Nayak, Rupaj Kumar, Desai, Jitamitra

“…In this paper, we study the performance of the Semidefinite Linear Complementarity Problem (SDLCP) for symmetric matrices that is equipped with a continuously…”
Get full text

A low complexity semidefinite relaxation for large-scale MIMO detection by Nayak, Rupaj Kumar, Biswal, Mahendra Prasad

“…Many wireless communication problems is based on a convex relaxation of the maximum likelihood problem which further can be cast as binary quadratic programs…”
Get full text

A bicriteria mixed-integer programming model for delay management in train timetabling by Rana, Sambit Sekhar, Nayak, Rupaj Kumar

“…Delay management in train is a necessary issue in these days. If a train arrives at some station with a delay, it is to be determined if the connecting train…”
Get full text

The impact of the additional features on the performance of regression analysis: a case study on regression analysis of music signal by Chivukula, V. N. Aditya Datta, Nayak, Rupaj Kumar

“…Machine learning techniques nowadays play a vital role in many burning issues of real-world problems when it involves data. In addition, when the task is…”
Get full text

Fast constraint satisfaction problem and learning-based algorithm for solving Minesweeper by Sinha, Yash Pratyush, Malviya, Pranshu, Nayak, Rupaj Kumar

“…Minesweeper is a popular spatial-based decision-making game that works with incomplete information. As an exemplary NP-complete problem, it is a major area of…”
Get full text