Search · four archives
Search · four archives
13 papers · ranked by Valyu relevance
Hao Hu, Renata Sotirov, Henry Wolkowicz
We consider both facial reduction, FR, and symmetry reduction, SR, techniques for semidefinite programming, SDP. We show that the two together fit surprisingly well in an alternating direction method of multipliers, ADMM, approach. In fact, this approach allows for simply adding on nonnegativity constraints, and…
Michiya Kuramata, Ryota Katsuki, Kazuhide Nakata, Gábor Vattay
Quantum annealing has gained considerable attention because it can be applied to combinatorial optimization problems, which have numerous applications in logistics, scheduling, and finance. In recent years, with the technical development of quantum annealers, research on solving practical combinatorial optimization…
Olga Brezhneva, Agnieszka Prusińska, Alexey A. Tret’yakov, Ravi P. Agarwal
'Ravi P. Agarwal'] The paper describes an application of the p-regularity theory to Quadratic Programming (QP) and nonlinear equations with quadratic mappings. In the first part of the paper, a special structure of the nonlinear equation and a construction of the 2-factor operator are used to obtain an exact formula…
Wei Lian, Fei Ma, Zhesen Cui, Hang Pan
In many applications, there is a need for algorithms that can align partially overlapping point clouds while remaining invariant to corresponding transformations. This research presents a method that achieves these goals by minimizing a binary linear assignment-least squares (BLALS) energy function. First, we…
Immanuel Bomze, Bo Peng, Yuzhou Qiu, E. Alper Yıldırım
Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, referred to as sparse StQPs. We focus on various tractable convex relaxations of sparse StQPs arising from a mixed-binary quadratic formulation…
Bruno Ordozgoiti, Ananth Mahadevan, Antonis Matakos, Aristides Gionis
When searching for information in a data collection, we are often interested not only in finding relevant items, but also in assembling a diverse set, so as to explore different concepts that are present in the data. This problem has been researched extensively. However, finding a set of items with minimal pairwise…
Amnon Rosenmann
The k-cardinality assignment (k-assignment, for short) problem asks for finding a minimal (maximal) weight of a matching of cardinality k in a weighted bipartite graph $K_{n,n}$, $k \le n$. Here we are interested in computing the sequence of all k-assignments, $k=1,\ldots ,n$. By applying the algorithm of Gassner and…
Alberto Ceselli, Marco Premoli
Several optimization solvers inspired by quantum annealing have been recently developed, either running on actual quantum hardware or simulating it on traditional digital computers. Industry and academics look at their potential in solving hard combinatorial optimization problems. Formally, they provide heuristic…
Finley Alexander Quinton, Per Arne Sevle Myhr, Mostafa Barani, Pedro Crespo del Granado + 1 more
'Pedro Crespo del Granado' 'Hongyu Zhang'] Quantum computing is rapidly advancing, harnessing the power of qubits’ superposition and entanglement for computational advantages over classical systems. However, scalability poses a primary challenge for these machines. By implementing a hybrid workflow between classical…
Mohammed Kharbach, Tarik Chfadi, Iván Barreda-Tarrazona
We introduce a modified Hotelling model setup that incorporates the original model and considers logistics’ related costs incurred by the firms. Both the linear and quadratic logistics related costs cases are studied. We find that the relative magnitudes of firms’ logistics costs to customers’ transportation and/or…
Qiannan Tian, Jie Li, Guoxuan Huang, Wei Yuan + 1 more
In this paper, an airport ground service task assignment problem is studied. A task represents a service, which must be performed by one or multiple ground crew of a shift with required qualification/proficiency within a prescribed time period. For every assigned task, define “task priority” times “task duration” as…
Elisabeth Gaar, Markus Sinnl
The discrete -neighbor -center problem (d--CP) is an emerging variant of the classical -center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate facilities on these points in such a way that the maximum distance between each point where no…
Panfei Li, Chongxing Ji, Jabir Mumtaz
The advent of the assembly line marked a significant technological innovation in the manufacturing industry, substantially enhancing production efficiency. Today, this production system is extensively adopted by numerous manufacturing enterprises. This paper introduces the Circular Assembly Line Balancing Problem with…