scholarly journals A Numerical Method for Solving Quadratic Integer Programming Problem

2019 ◽  
Vol 12 (3) ◽  
pp. 130-139
Author(s):  
V.M. Tat'yankin ◽  
◽  
A.V. Shitselov ◽  
Keyword(s):  
Integer Programming ◽  
Numerical Method ◽  
Programming Problem ◽  
Integer Programming Problem ◽  
Quadratic Integer Programming ◽  
Quadratic Integer

New bounds on the unconstrained quadratic integer programming problem

2007 ◽  
Vol 39 (4) ◽  
pp. 543-554 ◽  
Author(s):  
G. D. Halikias ◽  
I. M. Jaimoukha ◽  
U. Malik ◽  
S. K. Gungah
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Integer Programming Problem ◽  
Quadratic Integer Programming ◽  
Quadratic Integer

On the gap between the quadratic integer programming problem and its semidefinite relaxation

2005 ◽  
Vol 107 (3) ◽  
pp. 505-515 ◽  
Author(s):  
U. Malik ◽  
I.M. Jaimoukha ◽  
G.D. Halikias ◽  
S.K. Gungah
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Semidefinite Relaxation ◽  
Integer Programming Problem ◽  
Quadratic Integer Programming ◽  
Quadratic Integer

On Solution of a Certain Integer Programming Problem of a Specific Form

1998 ◽  
Vol 30 (4-5) ◽  
pp. 115-120
Author(s):  
Ivan V. Sergienko ◽  
V. A. Roshchin
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Specific Form ◽  
Integer Programming Problem

Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach

2010 ◽  
Vol 146 (2) ◽  
pp. 463-489 ◽  
Author(s):  
X. J. Zheng ◽  
X. L. Sun ◽  
D. Li
Keyword(s):  
Integer Programming ◽  
Quadratic Integer Programming ◽  
Quadratic Integer

TWO BI-OBJECTIVE OPTIMIZATION MODELS FOR COMPETITIVE LOCATION PROBLEMS

2006 ◽  
Vol 05 (03) ◽  
pp. 531-543 ◽  
Author(s):  
FENGMEI YANG ◽  
GUOWEI HUA ◽  
HIROSHI INOUE ◽  
JIANMING SHI
Keyword(s):  
Integer Programming ◽  
Programming Problem ◽  
Efficient Solutions ◽  
Integer Program ◽  
Location Problems ◽  
Optimization Models ◽  
Competitive Location ◽  
Integer Programming Problem ◽  
Single Objective ◽  
Parametric Integer Programming

This paper deals with two bi-objective models arising from competitive location problems. The first model simultaneously intends to maximize market share and to minimize cost. The second one aims to maximize both profit and the profit margin. We study some of the related properties of the models, examine relations between the models and a single objective parametric integer programming problem, and then show how both bi-objective location problems can be solved through the use of a single objective parametric integer program. Based on this, we propose two methods of obtaining a set of efficient solutions to the problems of fundamental approach. Finally, a numerical example is presented to illustrate the solution techniques.

Sign in / Sign up

Export Citation Format

Share Document