A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems
From MaRDI portal
Publication:5326806
DOI10.1002/net.21493zbMath1269.90133OpenAlexW2132353568WikidataQ57570730 ScholiaQ57570730MaRDI QIDQ5326806
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21493
integer programmingbranch-and-boundmultiple criteria decision makingmultiple objective programmingnetwork flow algorithmsnetwork flow problems with side constraints
Uses Software
Cites Work
- Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures
- A regression study of the number of efficient extreme points in multiple objective linear programming
- Multiple objective minimum cost flow problems: a review
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- On the computation of all supported efficient solutions in multi-objective integer network flow problems
- Efficient solutions for the bicriteria network flow problem
- Bicriteria network flow problems: Integer case
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS
- Interactive multiple objective programming using Tchebycheff programs and artificial neural networks
- The biobjective minimum cost flow problem
- A solver for the multi-objective transshipment problem with facility location
- An empirical investigation of some bicriterion shortest path algorithms
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Reference point method with importance weighted ordered partial achievements
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- The biobjective integer minimum cost flow problem -- incorrectness of Sedeño-Noda and Gonzàlez-Martin's algorithm
- Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming
- A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- Finding integer efficient solutions for multiple objective network programming problems
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- A Combined Tchebycheff/Aspiration Criterion Vector Interactive Multiobjective Programming Procedure
- Solving Multiple Objective Programming Problems Using Feed-Forward Artificial Neural Networks: The Interactive FFANN Procedure
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- An algorithm for the biobjective integer minimum cost flow problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
