AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS

DOI10.15807/JORSJ.45.299MaRDI QIDQ4797035zbMATH OpenOpenAlexFDO

Authors T. Koide, S. Shinmori, Hiroaki Ishii

Publication date 2002

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.45.299

zbMATH Keywords

network design problems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• A class of extremal combinatorial problems for multicomponent network design
• A generalized iterative scheme for network design problem
• On the approximability of some network design problems
• On the approximability of some network design problems
• scientific article; zbMATH DE number 1086915
• An efficient implementation of the network simplex method
• scientific article; zbMATH DE number 1532276
• Approximate integer decompositions for undirected network design problems
• scientific article; zbMATH DE number 1003253

This page was built for publication: AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS

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