Khachiyan's Algorithmus

DOI10.1007/BF01917145zbMATH Open0513.90054OpenAlexW1977121691MaRDI QIDQ3659528FDOQ3659528

Authors: Hans Hermann Weber 

Publication date: 1982

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01917145

zbMATH Keywords

simplex methodlinear integer programmingcomparison of algorithmsKhachiyan's algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• An existence-convergence theorem for a class of iterative methods
• A new linear programming algorithm - better or worse than the simplex method?
• Khachiyan's linear programming algorithm
• Title not available (Why is that?)
• Einige Erläuterungen zum Khacian-Verfahren

This page was built for publication: Khachiyan's Algorithmus

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