Results 61 to 70 of about 7,645,857 (241)

Exploiting Group Symmetry in Semidefinite Programming Relaxations of the Quadratic Assignment Problem [PDF]

open access: yes
We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment ...
Klerk, E. de, Sotirov, R.
core  

On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]

open access: yes
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de   +2 more
core  

The convex quadratic programming problem [PDF]

open access: yes, 1989
The purpose of this paper is to investigate the convex quadratic programming problem and its applications. The emphasis is on methods for solving the convex quadratic programming problem.
Williams, James R.
core  

Coordination of Bus Departures by Mathematical Programming

open access: yesCommunications, 2013
This paper deals with coordination of bus arrivals. A quality criterion of this problem is to minimize waiting time of passengers, to make public transport more attractive. One possibility for solving is to increase the number of arrivals with associated
Lydia Gabrisova, Petr Kozel
doaj   +1 more source

A simultaneous trajectory generation method for quadcopter intercepting ground mobile vehicle

open access: yesInternational Journal of Advanced Robotic Systems, 2017
This article proposes a trajectory generator for quadcopter to intercept moving ground vehicle. For this air–ground interaction problem, we formulate the trajectory generation problem as quadratic dynamic programming in a moving-horizon scheme based on ...
Jiangcheng Zhu, Jun Zhu, Chao Xu
doaj   +1 more source

Generating quadratic bilevel programming test problems

open access: yesACM Transactions on Mathematical Software, 1994
This paper describes a technique for generating sparse or dense quadratic bilevel programming problems with a selectable number of known global and local solutions. The technique described here does not require the solution of any subproblems. In addition, since most techniques for solving these problems begin by solving the corresponding relaxed ...
Paul H. Calamai, Luís Nunes Vicente
openaire   +2 more sources

An algorithm for solving quadratic programming problems

open access: yesComput. Sci. J. Moldova, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

On the Solution of a Nonlinear Semidefinite Program Arising in Discrete-Time Feedback Control Design

open access: yesJournal of Applied Mathematics, 2014
A sequential quadratic programming method with line search is analyzed and studied for finding the local solution of a nonlinear semidefinite programming problem resulting from the discrete-time output feedback problem.
El-Sayed M. E. Mostafa
doaj   +1 more source

A quadratic programming view of the linear complementary problem

open access: yes, 1990
This paper considers the linear complementary problem from a mathematical programming point of view.
Feiring, Bruce R.
core   +1 more source

Multivariate Nonnegative Quadratic Mappings [PDF]

open access: yes
In this paper we study several issues related to the characterization of speci c classes of multivariate quadratic mappings that are nonnegative over a given domain, with nonnegativity de ned by a pre-speci ed conic order.In particular, we consider the ...
Zhang, S., Sturm, J.F., Luo, Z-Q
core  

Home - About - Disclaimer - Privacy