\(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
From MaRDI portal
Publication:2379522
DOI10.1016/j.ejor.2008.12.034zbMath1188.90233OpenAlexW2084905742WikidataQ56920618 ScholiaQ56920618MaRDI QIDQ2379522
J. Lemesre, Clarisse Dhaenens, El-Ghazali Talbi
Publication date: 19 March 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.034
Related Items (21)
The \(L\)-shape search method for triobjective integer programming ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ A graph-based algorithm for the multi-objective optimization of gene regulatory networks ⋮ A hybrid approach for biobjective optimization ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Split algorithms for multiobjective integer programming problems ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Multiobjective integer nonlinear fractional programming problem: a cutting plane approach ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions ⋮ Finding a representative nondominated set for multi-objective mixed integer programs ⋮ Efficient computation of the search region in multi-objective optimization ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem ⋮ Multiobjective Integer Programming: Synergistic Parallel Approaches ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact parallel method for a bi-objective permutation flowshop problem
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Multiple and bicriteria scheduling: A literature survey
- A genetic algorithm for flowshop sequencing
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A bicriteria approach to the two-machine flow shop scheduling problem
- Benchmarks for basic scheduling problems
- Multicriteria scheduling problems: a survey
- Minimizing Total Tardiness on One Machine is NP-Hard
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
This page was built for publication: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
