The optimal assignment problem for a countable state space
Marianne Akian, Stephane Gaubert, Vassili Kolokoltsov
备注：
22 pages
发表信息：
Proceedings of the International Conference on Tropical and Idempotent Mathematics, G.L. Litvinov and S.N. Sergeev Eds, volume 495 in Contemporary Mathematics, pp 39--60, 2009, AMS
Given a square matrix B=(b_{ij}) with real entries, the optimal assignment problem is to find a bijection s between the rows and the columns maximising the sum of the b_{is(i)}. In discrete optimal control and in the theory of discrete event systems, one often encounters the problem of solving the equation Bf=g for a given vector g, where the same symbol B denotes the corresponding max-plus linear operator, (Bf)_i:=max_j (b_{ij}+f_j). The matrix B is said to be strongly regular when there exists a vector g such that the equation Bf=g has a unique solution f. A result of Butkovic and Hevery shows that B is strongly regular if and only if the associated optimal assignment problem has a unique solution. We establish here an extension of this result which applies to max-plus linear operators over a countable state space. The proofs use the theory developed in a previous work in which we characterised the unique solvability of equations involving Moreau conjugacies over an infinite state space, in terms of the minimality of certain coverings of the state space by generalised subdifferentials.
Solution of the optimal assignment problem by diagonal scaling algorithms
The University of Manchester（曼彻斯特大学）；INRIA（法国国家信息与自动化研究所）；Centre de Mathématiques Appliquées（应用数学中心）；Ecole Polytechnique（巴黎综合理工学院）；Laboratoire J.L. Lions（J.L. Lions实验室）；Universite Pierre et Marie Curie（皮埃尔和玛丽·居里大学）
Relative-Interior Solution for the (Incomplete) Linear Assignment Problem with Applications to the Quadratic Assignment Problem
Faculty of Electrical Engineering, Czech Technical University in Prague（捷克技术大学布拉格分校电子工程系）；Computer Vision and Learning Lab, IWR, University of Heidelberg（海德堡大学计算机视觉与学习实验室）
On Linear Programming for Constrained and Unconstrained Average-Cost Markov Decision Processes with Countable Action Spaces and Strictly Unbounded Costs
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
Institut Polytechnique de Paris（巴黎理工学院）；ENSTA（国立高等先进技术学院）；UMA（应用数学实验室）；Conservatoire National des Arts et Métiers（国立工艺博物馆）；CEDRIC（计算机科学与数字系统研究中心）；École Nationale Supérieure d’Informatique pour l’Industrie et l’Entreprise（工业与企业高级信息学院）
Embedding Assignment Routing Constraints through Multi Dimensional Network Construction for Solving the Multi Vehicle Routing Problem with Pickup and Delivery with Time Windows
Gromov-Wasserstein and optimal transport: from assignment problems to probabilistic numeric
University of Milano-Bicocca, Department of Computer Science Systems and Communication（米兰-比科卡大学计算机科学与通信系）；University of Milano-Bicocca, Department of Economics Management and Statistics（米兰-比科卡大学经济学管理与统计系）
Active Learning with Imperfect Labels: Optimal Labeler Assignment and Sample Selection
School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332, USA（工业与系统工程学院 佐治亚理工学院 阿拉巴马州亚特兰大 30332, 美国）；Ford Motor Company（福特汽车公司）
