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

13 years 4 months ago

Download www.cs.brown.edu

An efficient exterior point simplex type algorithm for the assignment problem has been developed by Paparrizos [K. Paparrizos, An infeasible (exterior point) simplex algorithm for assignment problems, Math. Program. 51 (1991) 45

Charalampos Papamanthou, Konstantinos Paparrizos,

Real-time Traffic

Algorithm | Assignment Problems | DISOPT 2008 | Exterior Point |

claim paper

» Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

» Norm Point and Distance Estimation Over Multiple Signals Using MaxStable Distributions

» Dynamic spectrum access in DTV whitespaces design rules architecture and algorithms

» Restricted Strip Covering and the Sensor Cover Problem

» Improving Strategies via SMT Solving

» Twos Company Threes a Crowd Stable Family and Threesome Roommates Problems

» An Algebraic Geometry Approach to Protein Structure Determination from NMR Data

» On the importance of idempotence

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DISOPT
Authors	Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras, Konstantinos Stergiou

Comments (0)

Sciweavers

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

Algorithm | Assignment Problems | DISOPT 2008 | Exterior Point |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers