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.

The simplicial approximation approach to design centering

Abstract: The basis of a method for designing circuits in the face of parameter uncertainties is described. This method is computationally cheaper than those methods which employ Monte Carlo analysis and nonlinear programming techniques, gives more useful information, and more directly addresses the central problem of design centering. The method, called simplicial approximation, locates and approximates the boundary of the feasible region of an n -dimensional design space with a polyhedron of bounding ( n - 1 )-simplices. The design centering problem is solved by determining the location of the center of the maximal hyperellipsoid inscribed within this polyhedron. The axis lengths of this ellipsoid can be used to solve the tolerance assignment problem. In addition, this approximation can be used to estimate the yield by performing an inexpensive Monte Carlo analysis in the parameter space without any need for the usual multitude of circuit simulations.

Wavelength assignment in fixed routing WDM networks

Abstract: We propose a new algorithm for the dynamic centralized wavelength assignment problem in fixed-routing WDM networks without wavelength conversion. The blocking performance of our algorithm is better in many cases (and no worse in tire cases we studied) than other previously proposed algorithms. The performance improvement of our algorithm over other algorithms is high for multi-fiber ring networks with a moderate number of fibers per link. In a multi-fiber mesh-torus network, the difference in performance is not as significant, but the blocking probabilities for all algorithms approach those achievable by wavelength conversion as the number of fibers per link increases. We also extend an earlier analytical model for predicting the blocking probability with and without wavelength conversion to dense multi-fiber networks. Finally, our simulation results on multi-fiber rings and mesh-tori reveal surprising results about the benefits of wavelength conversion as the number of fibers per link increases.

Optimization‐based procurement for transportation services

Abstract: This paper presents the concept of optimization-based procurement for transportation services. The approach allows both the shipper and carriers to benefit through the use of a collaborative approach to securing and managing a strategic relationship. Because the shipper's assignment problem involves a combinatorial number of choices and cannot be easily executed manually, the procurement process benefits strongly from the use of optimization. The authors introduce the optimization-based procurement process, briefly analyze the theoretical issues, and discuss lessons learned from its application in practice over the last several years.

A distributed auction algorithm for the assignment problem

Abstract: The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the areas of distributed control and facility allocation, where the problems? size and the cost for global computation and information can be highly prohibitive, gives rise to the need for local solutions that dynamically assign distinct agents to distinct tasks, while maximizing the total assignment benefit. In this paper, we consider the linear assignment problem in the context of networked systems, where the main challenge is dealing with the lack of global information due to the limited communication capabilities of the agents. We address this challenge by means of a distributed auction algorithm, where the agents are able to bid for the task to which they wish to be assigned. The desired assignment relies on an appropriate selection of bids that determine the prices of the tasks and render them more or less attractive for the agents to bid for. Up to date pricing information, necessary for accurate bidding, can be obtained in a multi-hop fashion by means of local communication between adjacent agents. Our algorithm is an extension to the parallel auction algorithm proposed by Bertsekas et al to the case where only local information is available and it is shown to always converge to an assignment that maximizes the total assignment benefit within a linear approximation of the optimal one.