Finding non-dominated solutions for bi-objective integer transportation problem

zbMATH Open1254.90027MaRDI QIDQ4898091FDOQ4898091

Authors: N. Delfzergan, Hadi Basirzadeh 

Publication date: 29 December 2012

Recommendations

• Finding non-dominated solutions in bi-objective integer network flow problems
• A new method to solve bi-objective transportation problem
• Interactive solutions for the linear multiobjective transportation problem
• The multiobjective bottleneck transportation problem.
• scientific article; zbMATH DE number 1783864

zbMATH Keywords

transportation modelbi-objective programming problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (6)

• A super non-dominated point for multi-objective transportation problem
• Nondominated solutions of cost-time trade-off transportation and assignment problems
• Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
• Title not available (Why is that?)
• A new method to solve bi-objective transportation problem
• Finding non-dominated solutions in bi-objective integer network flow problems

This page was built for publication: Finding non-dominated solutions for bi-objective integer transportation problem

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