Core-guided method for constraint-based multi-objective combinatorial optimization
- 1 June 2021
- journal article
- research article
- Published by Springer Science and Business Media LLC in Applied Intelligence
- Vol. 51 (6), 3865-3879
- https://doi.org/10.1007/s10489-020-01998-5
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (61672261, 61872159, 61806050, 61972063)
This publication has 42 references indexed in Scilit:
- Two-phase Pareto local search for the biobjective traveling salesman problemJournal of Heuristics, 2009
- SMS-EMOA: Multiobjective selection based on dominated hypervolumeEuropean Journal of Operational Research, 2007
- Algorithms for Computing Minimal Unsatisfiable Subsets of ConstraintsJournal of Automated Reasoning, 2007
- Consistent subsets of inconsistent systems: structure and behaviourJournal of Experimental & Theoretical Artificial Intelligence, 2003
- Pseudo-Boolean optimizationDiscrete Applied Mathematics, 2002
- Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approachIEEE Transactions on Evolutionary Computation, 1999
- The SAT phase transitionScience China Technological Sciences, 1999
- Multi‐objective combinatorial optimization problems: A surveyJournal of Multi-Criteria Decision Analysis, 1994
- A theory of diagnosis from first principlesArtificial Intelligence, 1987
- The Use of Ranks to Avoid the Assumption of Normality Implicit in the Analysis of VarianceJournal of the American Statistical Association, 1937