Studies of lexicography in the generalized network simplex method

DOI10.1007/BF02023097MaRDI QIDQ1312763zbMATH OpenFDO

Authors José C. Arantes, Katta G. Murty, John R. Birge

Publication date 5 May 1994

Published in Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

cyclinggeneralized network problemslexicography

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35)

Recommendations

• Lexicographic optimisation in generalised network flow problems
• On the simplex algorithm for networks and generalized networks
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network
• Computing leximin-optimal solutions in constraint networks
• scientific article; zbMATH DE number 1353833
• Topological versus dynamical robustness in a lexical network
• An improved general procedure for lexicographic bottleneck problems
• Learning the structural vocabulary of a network
• Lexicographic-lexicographical optimization problems with alternative criteria

Cites work

• A Strongly Convergent Primal Simplex Algorithm for Generalized Networks
• On the simplex algorithm for networks and generalized networks

Cited in

(1)

• On the simplex algorithm for networks and generalized networks

This page was built for publication: Studies of lexicography in the generalized network simplex method

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