Results 21 to 30 of about 10,477 (184)
Mechanisms for House Allocation with Existing Tenants under Dichotomous Preferences
Journal of Mechanism and Institution Design, 2018 We consider house allocation with existing tenants in which each agent has dichotomous preferences. We present strategyproof, polynomial-time, and (strongly) individually rational algorithms that satisfy the maximum number of agents.
Haris Aziz
doaj +1 more source
Primal-dual path-following algorithms for circular programming
Communications in Combinatorics and Optimization, 2017 Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser.
Baha Alzalg, M. Pirhaji
doaj +1 more source
Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance
Journal of Applied Mathematics, 2013 In a shortest path improvement problem under unit Hamming distance (denoted by SPIUH), an edge weighted graph with a set of source-terminal pairs is given; we need to modify the lengths of edges by a minimum cost under unit Hamming distance such that the
Bingwu Zhang +3 more
doaj +1 more source
ROBUST VISION-BASED POSE ESTIMATION ALGORITHM FOR AN UAV WITH KNOWN GRAVITY VECTOR [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 Accurate estimation of camera external orientation with respect to a known object is one of the central problems in photogrammetry and computer vision. In recent years this problem is gaining an increasing attention in the field of UAV autonomous flight.
V. V. Kniaz
doaj +1 more source
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Archives of Control Sciences, 2016 In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent
Furmańczyk Hanna +2 more
doaj +1 more source
Hypergraph Connectivity Augmentation in Strongly Polynomial Time [PDF]
We consider hypergraph network design problems where the goal is to construct a hypergraph that satisfies certain connectivity requirements. For graph network design problems where the goal is to construct a graph that satisfies certain connectivity ...
Bérczi, Kristóf +3 more
core +3 more sources
Energies, 2023 Extending the lifetime of wireless sensor networks (WSNs) and minimizing energy costs are the two most significant concerns for data transmission.
Sharmin Sharmin +2 more
doaj +1 more source
Short-step methods are not strongly polynomial-time [PDF]
, 2023 Short-step methods are an important class of algorithms for solving convex constrained optimization problems. In this short paper, we show that under very mild assumptions on the self-concordant barrier and the width of the ℓ2-neighbourhood, any short ...
Manru Zong +5 more
core +1 more source
Science and Technology of Nuclear Installations, 2023 Establishing a dynamic model that accurately describes a realistic pressurized water reactor (PWR) fuel assembly is crucial to precisely evaluate the mechanical properties of the fuel assembly in seismic or loss of coolant accidents (LOCAs).
Chen Yang +3 more
doaj +1 more source
Strong, Strongly Universal and Weak Interval Eigenvectors in Max-Plus Algebra
Mathematics, 2020 The optimization problems, such as scheduling or project management, in which the objective function depends on the operations maximum and plus, can be naturally formulated and solved in max-plus algebra. A system of discrete events, e.g., activations of
Martin Gavalec +2 more
doaj +1 more source