Worst case examples of an exterior point algorithm for the assignment problem

DOI10.1016/j.disopt.2007.12.003zbMath1140.90468OpenAlexW1972928688MaRDI QIDQ937404

Konstantinos Stergiou, Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras

Publication date: 15 August 2008

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2007.12.003

zbMATH Keywords

exterior point algorithmassignment problemworst case examples

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27)

Related Items (1)

Exterior point simplex-type algorithms for linear and network optimization problems

Cites Work

• An infeasible (exterior point) simplex algorithm for assignment problems
• Algorithms and codes for dense assignment problems: The state of the art
• The Hirsch Conjecture for Dual Transportation Polyhedra
• Signature Methods for the Assignment Problem
• A competitive (dual) simplex method for the assignment problem
• Transportation problems which can be solved by the use of hirsch-paths for the dual problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Worst case examples of an exterior point algorithm for the assignment problem