A versatile scheme for ranking the extreme points of an assignment polytope

DOI10.1002/NAV.3800280404zbMATH Open0535.90064OpenAlexW2054628374MaRDI QIDQ3320125FDOQ3320125

Authors: Hanif D. Sherali, Mokhtar S. Bazaraa 

Publication date: 1981

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800280404

Recommendations

• An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
• A note on a new variant of Murty's ranking assignments algorithm
• An algorithm for ranking assignments using reoptimization
• On Extreme Point Programming Problem
• scientific article; zbMATH DE number 165312

zbMATH Keywords

linear assignment problemsComputational experiencecutting plane schemeimplicit enumeration frameworkranking the extreme points

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Polytopes and polyhedra (52Bxx) Boolean programming (90C09)

Cites Work

• An Improved Implicit Enumeration Approach for Integer Programming
• Title not available (Why is that?)

Cited In (5)

• Extreme point Quadratic Minimization Problem
• Mixed-integer bilinear programming problems
• Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
• Equivalent weights for lexicographic multi-objective programs: Characterizations and computations
• A note on a new variant of Murty's ranking assignments algorithm

This page was built for publication: A versatile scheme for ranking the extreme points of an assignment polytope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320125)