A survey and annotated bibliography of multiobjective combinatorial optimization

DOI10.1007/S002910000046zbMath1017.90096OpenAlexW2083743691MaRDI QIDQ1841810

Xavier Gandibleux, Matthias Ehrgott

Publication date: 26 August 2003

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002910000046

zbMATH Keywords

heuristicsbibliographycombinatorial optimizationmulticriteria optimizationexact methods

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)

Related Items (only showing first 100 items - show all)

Postoptimal analysis of the multicriteria combinatorial median location problem ⋮ On combinatorial optimization motivated by biology ⋮ Simultaneous Approximation of Constraint Satisfaction Problems ⋮ Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems ⋮ A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems ⋮ Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem ⋮ An improved algorithm for solving biobjective integer programs ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ A bi-criteria approach for the data association problem ⋮ Stability and accuracy functions in multicriteria linear combinatorial optimization problems ⋮ On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ A discussion of scalarization techniques for multiple objective integer programming ⋮ Computing all efficient solutions of the biobjective minimum spanning tree problem ⋮ A Logic-Based Framework for Reasoning about Composite Data Structures ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ Unnamed Item ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ An improved multiobjective shortest path algorithm ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ Multi-objective matroid optimization with ordinal weights ⋮ Data-driven predictive maintenance policy based on multi-objective optimization approaches for the component repairing problem ⋮ Efficiently approximating high-dimensional Pareto frontiers for tree-structured networks using expansion and compression ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Finding shortest and dissimilar paths ⋮ Inverse attribute‐based optimization with an application in assortment optimization ⋮ A tutorial on multiobjective optimization: fundamentals and evolutionary methods ⋮ The trade-off between costs and carbon emissions from economic lot-sizing decisions ⋮ Fairness in maximal covering location problems ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ The Steiner bi-objective shortest path problem ⋮ Parallel optimization over the integer efficient set ⋮ Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Multiobjective blockmodeling for social network analysis ⋮ Inverse multi-objective combinatorial optimization ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning ⋮ Propagation algorithms for lexicographic ordering constraints ⋮ Smart Production by Integrating Product-Mix Planning and Revenue Management for Semiconductor Manufacturing ⋮ Project portfolio selection model, a realistic approach ⋮ A survey of recent developments in multiobjective optimization ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ The biobjective minimum-cost perfect matching problem and Chinese postman problem ⋮ Constructing robust crew schedules with bicriteria optimization ⋮ An approximation scheme for the bi-scenario sum of completion times trade-off problem ⋮ The complexity of bottleneck labeled graph problems ⋮ Stochastic multi-objective optimization: a survey on non-scalarizing methods ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ Realization problems on reachability sequences ⋮ A hybrid particle swarm approach based on Tribes and tabu search for multi-objective optimization ⋮ Empirical study of exact algorithms for the multi-objective spanning tree ⋮ How Good is the Chord Algorithm? ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Finding integer efficient solutions for multiple objective network programming problems ⋮ A quantum adiabatic algorithm for multiobjective combinatorial optimization ⋮ Outer Branching: How to Optimize under Partial Orders? ⋮ A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm ⋮ Genetic local search for multi-objective flowshop scheduling problems ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ The influence of the fitness evaluation method on the performance of multiobjective search algorithms ⋮ Multi-objective tabu search using a multinomial probability mass function ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ MOAQ and ant-Q algorithm for multiple objective optimization problems ⋮ A bicriteria approach identifying nondominated portfolios ⋮ Stability radius of a lexicographic optimum of a vector problem of Boolean programming ⋮ Resource-constrained project scheduling through the goal programming model: integration of the manager's preferences ⋮ Exact approaches for solving robust prize-collecting Steiner tree problems ⋮ Cone contraction and reference point methods for multi-criteria mixed integer optimization ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem ⋮ Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection ⋮ Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ A multi-agent transgenetic algorithm for the bi-objective spanning tree problem ⋮ The biobjective travelling purchaser problem ⋮ Solving multi-objective production scheduling problems using metaheuristics ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ A biobjective optimization model for routing in mobile ad hoc networks ⋮ A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives ⋮ Multicriteria optimization in humanitarian aid ⋮ Design of a heuristic algorithm for the generalized multi-objective set covering problem ⋮ Solution approaches for equitable multiobjective integer programming problems ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ A biobjective method for sample allocation in stratified sampling ⋮ Decision-support with preference constraints ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia ⋮ Multi-objectives tabu search based algorithm for progressive resource allocation ⋮ A new approach for the multiobjective minimum spanning tree ⋮ A graph-based algorithm for the multi-objective optimization of gene regulatory networks ⋮ A population-based algorithm for solving linear assignment problems with two objectives ⋮ An interactive approximation algorithm for multi-objective integer programs

Uses Software

• EMOO

This page was built for publication: A survey and annotated bibliography of multiobjective combinatorial optimization