5 papers · ranked by Valyu relevance
Briański, Marcin, Lassota, Alexandra + 6 more
Solving integer programs of the form min x A x = b , l ⩽ x ⩽ u , x ∈ Z n is, in general, NP-hard. Hence, great effort has been put into identifying subclasses of integer programs that are solvable in polynomial or FPT time. A common scheme for many of these integer programs is a star-like structure of the constraint…
Kapil Goswami, Peter Schmelcher, Rick Mukherjee
Integer programming (IP), as the name suggests is an integer-variable-based approach commonly used to formulate real-world optimization problems with constraints. Currently, quantum algorithms reformulate the IP into an unconstrained form through the use of binary variables, which is an indirect and resource-consuming…
Hongyu Cheng, Amitabh Basu
The branch-and-cut algorithm is the method of choice to solve large scale integer programming problems in practice. A key ingredient of branch-and-cut is the use of cutting planes which are derived constraints that reduce the search space for an optimal solution. Selecting effective cutting planes to produce small…
Xiang He, Peng Lin, Shaowei Cai
Integer Quadratic Programming (IQP) is an important problem in operations research. Local search is a powerful method for solving hard problems, but the research on local search algorithms for IQP solving is still on its early stage. This paper develops an efficient local search solver for solving general IQP, called…
Ali Kadhim Yaqoob, Mohamed O. Saeed, Ghufran Khalil Joad, Oliyath Ali
systems Authors: ['Ali Kadhim Yaqoob' 'Mohamed O. Saeed' 'Ghufran Khalil Joad' 'Oliyath Ali'] Increasing the complexity of solving budgetary allocation (NP-hardness problem) has led a wide range of methods to minimize the costs. Metaheuristics and Linear Programming (LP) are the most optimisation in this fields.…