scientific article; zbMATH DE number 1003246

MaRDI QIDQ4335206zbMATH OpenFDO

Authors David Eppstein

Publication date 23 April 1997

zbMATH Keywords

computational geometryoptimal pivot selectionprimal network simplex algorithmtree clustering

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Publication:4488857
• scientific article; zbMATH DE number 1086915
• A new pivot selection rule for the network simplex algorithm
• The Scaling Network Simplex Algorithm
• scientific article; zbMATH DE number 4174642

Cited in

(4)

• scientific article; zbMATH DE number 1471729 (Why is no real title available?)
• Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering
• A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
• A comparison of pivot selection rules for primal simplex based network codes

This page was built for publication:

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