Topic
Assignment problem
About: Assignment problem is a research topic. Over the lifetime, 7588 publications have been published within this topic receiving 172820 citations. The topic is also known as: marriage problem.
Papers published on a yearly basis
Papers
More filters
TL;DR: An exact solution method based upon a reformulation linearization technique that is one of the best available for solving the quadratic assignment problem (QAP) and is useful for Q3AP instances of size 13 or smaller is presented.
45 citations
TL;DR: The purpose of the present note is to provide explicit MILP formulations that dramatically reduce the number of variables and theNumber of constraints for variety of UAV tour assignment problems including the two models mentioned above and via simulation the authors show significance of these new formulations.
Abstract: In recent years, considerable attention has been given to research on various aspects of unmanned aerial vehicles (UAVs) applications. UAVs are currently used for various military and civilian missions in the air, sea, space, and on the ground. In two recent papers, Shima (2007) and Kim (2007) considered closely similar m-UAV problems. In Shima (2007), the problem is considered with each target being served by only one UAV to minimize the total travel distance across all UAVs (called load balancing), however, in Kim (2007), the problem is considered with maximum number of targets that each UAV can serve with the objective of minimizing load balancing. Kim presented mixed integer linear programming (MILP) formulations of the load balancing problem both for when the UAVs return to their original depot and when they do not. Shima presented a combinatorial optimization formulation of their model with a branch-and-bound solution procedure. The MILP formulation of the load balancing problem is also adaptable to Shima 's problem. However, there are major inefficiencies with the MILP formulation presented in Kim 's model. In fact, The MILP formulations presented in Kim are highly complicated with huge number of variables and constraints making them impractical for applications. The purpose of the present note is to provide explicit MILP formulations that dramatically reduce the number of variables and the number of constraints for variety of UAV tour assignment problems including the two models mentioned above and via simulation we show significance of these new formulations.
45 citations
01 Jan 1993
TL;DR: In this article, it was shown that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm.
Abstract: We show that with recently developed derandomization techniques, one can convert Clarkson’s randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is dO Žd ., which is better than those for previously known algorithms. We show that the algorithm works in a fairly general abstract setting, which allows us to solve various other problems, e.g., computing the minimum-volume ellipsoid enclosing a set of n points and finding the maximum volume ellipsoid in the intersection of n halfspaces. Q 1996 Academic Press, Inc.
45 citations
TL;DR: The results of implementation and verification based on field programmable gate array device show the feasibility of the digital neural network approach to the assignment problem.
45 citations
TL;DR: A binary integer multi-commodity gate flow network model is presented with the objective of minimizing the fuel burn cost of aircraft taxi by type and expected passenger discomfort for ''tight'' connections as a function of inter-gate distance and connection time.
45 citations