An algorithm for the biobjective integer minimum cost flow problem

DOI10.1016/S0305-0548(99)00095-7zbMath0990.90122MaRDI QIDQ5926033

No author found.

Publication date: 12 March 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

network programming

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items

Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem, An improved algorithm for solving biobjective integer programs, Algorithm robust for the bicriteria discrete optimization problem, Multi-criteria assignment problem with incompatibility and capacity constraints, Ranking function-based solutions of fully fuzzified minimal cost flow problem, Multiple objective minimum cost flow problems: a review, A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems, A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives, A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project, Connectedness of efficient solutions in multiple objective combinatorial optimization, Two phase algorithms for the bi-objective assignment problem, The solution and duality of imprecise network problems, Primal-dual simplex method for multiobjective linear programming, The biobjective undirected two-commodity minimum cost flow problem, Combinatorial algorithms for the minimum interval cost flow problem, The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm, Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming, A two-phase algorithm for the biobjective integer minimum cost flow problem, Finding non-dominated solutions in bi-objective integer network flow problems, On the computation of all supported efficient solutions in multi-objective integer network flow problems

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Interactive solutions for the linear multiobjective transportation problem
• Bicriteria network flow problems: Continuous case
• Efficient solutions for the bicriteria network flow problem
• Bicriteria network flow problems: Integer case
• An approach for the network flow problem with multiple objectives
• Bicriteria Transportation Problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A network simplex method
• The enumeration of all efficient solutions for a linear multiple-objective transportation problem