Critical objective function values in linear sum assignment problems
type: Item
instance of: scholarly article
title: Critical objective function values in linear sum assignment problems
zbMATH Open document ID: 1396.90070
author: Ivan Belik
author: Kurt Jörnsten
published in: Journal of Combinatorial Optimization
publication date: 2018-04-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6859591
zbMATH Keywords: linear sum assignment problem
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: optimal multiplier
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s10878-017-0240-z
OpenAlex ID: W2773717755
cites work: A genuinely polynomial primal simplex algorithm for the assignment problem
cites work: Signature Methods for the Assignment Problem
cites work: The auction algorithm: A distributed relaxation method for the assignment problem
cites work: Dual coordinate step methods for linear network flow problems
cites work: Assignment Problems
cites work: A network simplex method
cites work: Q3844775
cites work: Q5615775
cites work: A Combinatorial Algorithm
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Scaling algorithms for network problems
cites work: Solving the Assignment Problem by Relaxation
cites work: Assignment Problems and the Location of Economic Activities
cites work: Q5519710
cites work: Q5519711
cites work: Algorithms for the Assignment and Transportation Problems
cites work: On the optimal allocation of virtual resources in cloud computing networks
cites work: Dynamic programming based metaheuristics for the dial-a-ride problem
cites work: On some techniques useful for solution of transportation network problems
DOI: 10.1007/S10878-017-0240-Z
description: scientific article; zbMATH DE number 6859591