Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
From MaRDI portal
Publication:869006
DOI10.1016/J.COR.2005.09.014zbMATH Open1147.90391DBLPjournals/cor/LemesreDT07OpenAlexW1966898882WikidataQ56920654 ScholiaQ56920654MaRDI QIDQ869006FDOQ869006
Authors: J. Lemesre, El-Ghazali Talbi, Clarisse Dhaenens 
Publication date: 26 February 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00269956/file/COR_07_Dhaenens.pdf
Recommendations
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- An exact parallel method for a bi-objective permutation flowshop problem
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
- Parallel hybrid algorithm for solving pseudomonotone equilibrium and split common fixed point problems
- A new approach for bicriteria partitioning problem
- A parallel algorithm for multiple objective linear programs
- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
- scientific article; zbMATH DE number 1206103
- scientific article; zbMATH DE number 6303703
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Multicriteria scheduling problems: a survey
- The Complexity of Flowshop and Jobshop Scheduling
- A genetic algorithm for flowshop sequencing
- Minimizing Total Tardiness on One Machine is NP-Hard
- An exact parallel method for a bi-objective permutation flowshop problem
- Benchmarks for basic scheduling problems
- Permutation flowshop scheduling problems with maximal and minimal time lags
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Title not available (Why is that?)
- Multiple and bicriteria scheduling: A literature survey
- Improved genetic algorithm for the permutation flowshop scheduling problem.
Cited In (12)
- A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Multiobjective Integer Programming: Synergistic Parallel Approaches
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- Finding a representative nondominated set for multi-objective mixed integer programs
- An exact parallel method for a bi-objective permutation flowshop problem
- Solving multi-criteria scheduling flow shop problem through compromise programming and satisfaction functions
- A hybrid approach for biobjective optimization
- Effective anytime algorithm for multiobjective combinatorial optimization problems
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
This page was built for publication: Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q869006)
