K-PPM: a new exact method to solve multi-objective combinatorial optimization problems
From MaRDI portal
Publication:2379522
DOI10.1016/J.EJOR.2008.12.034zbMATH Open1188.90233DBLPjournals/eor/DhaenensLT10OpenAlexW2084905742WikidataQ56920618 ScholiaQ56920618MaRDI QIDQ2379522FDOQ2379522
Authors: Clarisse Dhaenens, J. Lemesre, 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
Recommendations
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- An exact parallel method for a bi-objective permutation flowshop problem
- A level set method for multiobjective combinatorial optimization: application to the quadratic assignment problem
- scientific article; zbMATH DE number 915988
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
Cites Work
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Multicriteria scheduling problems: a survey
- The Complexity of Flowshop and Jobshop Scheduling
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- A genetic algorithm for flowshop sequencing
- Minimizing Total Tardiness on One Machine is NP-Hard
- Title not available (Why is that?)
- An exact parallel method for a bi-objective permutation flowshop problem
- Benchmarks for basic scheduling problems
- A bicriteria approach to the two-machine flow shop scheduling problem
- Title not available (Why is that?)
- Multiple and bicriteria scheduling: A literature survey
- A level set method for multiobjective combinatorial optimization: application to the quadratic assignment problem
Cited In (24)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Distribution based representative sets for multi-objective integer programs
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- Optimising a nonlinear utility function in multi-objective integer programming
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- Finding a representative nondominated set for multi-objective mixed integer programs
- The \(L\)-shape search method for triobjective integer programming
- Dynamic programming algorithms for the bi-objective integer knapsack problem
- An exact parallel method for a bi-objective permutation flowshop problem
- Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- A graph-based algorithm for the multi-objective optimization of gene regulatory networks
- A hybrid approach for biobjective optimization
- Efficient computation of the search region in multi-objective optimization
- A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods
- Split algorithms for multiobjective integer programming problems
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- 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
- A coverage-based box-algorithm to compute a representation for optimization problems with three objective functions
- An exact method for solving the bi-objective minimum diameter-cost spanning tree problem
This page was built for publication: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379522)
