Finding integer efficient solutions for multiple objective network programming problems
From MaRDI portal
Publication:3087624
DOI10.1002/net.20407zbMath1223.90060OpenAlexW2047683846WikidataQ57570749 ScholiaQ57570749MaRDI QIDQ3087624
Publication date: 16 August 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20407
integer programmingmultiple criteria decision makingmultiple objective programmingnetwork flow algorithms
Programming involving graphs or networks (90C35) Integer programming (90C10) Multi-objective and goal programming (90C29)
Related Items
Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach, A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures
- 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
- 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
- A solver for the multi-objective transshipment problem with facility location
- A survey and annotated bibliography of multiobjective combinatorial optimization
- 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 primal algorithm for solving a capacitated network flow problem with additional linear constraints
- 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
