scientific article; zbMATH DE number 4068646

zbMATH Open0654.90092MaRDI QIDQ3801367FDOQ3801367

Mustafa Akgül

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• Finding all optimal solutions to the network flow problem
• The structure of the optimal solution set on the shortest paths for networks
• Algorithms for construction of optimal and suboptimal solutions in network optimization problems
• Network Optimization Problems: Algorithms, Applications and Complexity
• Characterization of all optimal solutions and parametric maximal mows in networks
• On the approximability of some network design problems
• On the approximability of some network design problems
• A class of problems of optimal net synthesis
• A method of network programming in problems of nonlinear optimization
• Network design via iterative rounding of setpair relaxations

zbMATH Keywords

shortest pathset of feasible solutionsset of optimal solutionsmatroid operationsgraph with adjusted parameters

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (1)

• Finding all optimal solutions to the network flow problem

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 Q3801367)