Multi‐objective combinatorial optimization problems: A survey
From MaRDI portal
Publication:4896386
DOI10.1002/mcda.4020030204zbMath0853.90098OpenAlexW2092517593MaRDI QIDQ4896386
E. L. Ulungu, Jacques jun. Teghem
Publication date: 22 October 1996
Published in: Journal of Multi-Criteria Decision Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mcda.4020030204
surveytransportationcombinatorial optimizationtravelling salesmanassignmentknapsacknetwork flowallocationmulti-objective linear programmingtransshipment
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Variable and large neighborhood search to solve the multiobjective set covering problem, Advancing local search approximations for multiobjective combinatorial optimization problems, The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study, Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency, Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, Dynamic programming algorithms for the bi-objective integer knapsack problem, Preface. Multiobjective discrete and combinatorial optimization (MODCO), Multi-criteria assignment problem with incompatibility and capacity constraints, A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem, Resource allocation in multi-class dynamic PERT networks with finite capacity, Design of a heuristic algorithm for the generalized multi-objective set covering problem, Solution approaches for equitable multiobjective integer programming problems, Multiple objective minimum cost flow problems: a review, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, A biobjective method for sample allocation in stratified sampling, Analysis of FPTASes for the multi-objective shortest path problem, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem, Multiobjective vehicle routing problem with fixed delivery and optional collections, Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems, Two‐phase strategies for the bi‐objective minimum spanning tree problem, Optimal hierarchical clustering on a graph, A criterion space decomposition approach to generalized tri-objective tactical resource allocation, Finding shortest and dissimilar paths, Approximating combinatorial optimization problems with the ordered weighted averaging criterion, The Complexity of Bottleneck Labeled Graph Problems, Boolean lexicographic optimization: algorithms \& applications, A review of multiobjective programming and its application in quantitative psychology, The Pareto-optimal solution set of the equilibrium network design problem with multiple commensurate objectives, The multiscenario lot size problem with concave costs., Using metaheuristics in multiobjective resource constrained project scheduling, A tolerance function for the multiobjective set covering problem, On preprocessing for weighted MaxSAT, A survey of recent developments in multiobjective optimization, An algorithm for approximating the Pareto set of the multiobjective set covering problem, Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems, A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems, Application of complex networks theory in urban traffic network researches, Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors., A preference-based approach to spanning trees and shortest paths problems, An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems, A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs, Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming, Multiple criteria facility location problems: a survey, Optimizing a linear function over an integer efficient set, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, Genetic local search for multi-objective combinatorial optimization, Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations, The complexity of bottleneck labeled graph problems, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, Solving the Multiple Objective Integer Linear Programming Problem, Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS, A Method for Generating a Well-Distributed Pareto Set in Multiple Objective Mixed Integer Linear Programs Based on the Decision Maker’s Initial Aspiration Level, An Algorithm For Solving Multiple Objective Integer Linear Programming Problem, An interactive heuristic method for multi-objective combinatorial optimization, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, Cutting plane method for multiple objective stochastic integer linear programming, Multi-objective tabu search using a multinomial probability mass function, The multiobjective multidimensional knapsack problem: a survey and a new approach, Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite, Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming, Multiobjective solution of the uncapacitated plant location problem, A fuzzy genetic algorithm for driver scheduling, A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
