Critical objective function values in linear sum assignment problems

DOI10.1007/s10878-017-0240-zzbMath1396.90070OpenAlexW2773717755MaRDI QIDQ1743488

Ivan Belik, Kurt O. Jørnsten

Publication date: 13 April 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0240-z

zbMATH Keywords

Lagrangian relaxationlinear sum assignment problemoptimal multiplier

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genuinely polynomial primal simplex algorithm for the assignment problem
• Scaling algorithms for network problems
• Dual coordinate step methods for linear network flow problems
• The auction algorithm: A distributed relaxation method for the assignment problem
• Algorithms for the Assignment and Transportation Problems
• Assignment Problems and the Location of Economic Activities
• Assignment Problems
• Signature Methods for the Assignment Problem
• Solving the Assignment Problem by Relaxation
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A network simplex method
• On the optimal allocation of virtual resources in cloud computing networks
• On some techniques useful for solution of transportation network problems
• A Combinatorial Algorithm
• Dynamic programming based metaheuristics for the dial-a-ride problem

This page was built for publication: Critical objective function values in linear sum assignment problems