Suchergebnisse - "multi-objective combinatorial optimization problems"
-
1
Autoren: et al.
Weitere Verfasser: et al.
Quelle: Mathematical Biosciences and Engineering [ISSN 1547-1063], v. 19 (4), p. 3369-3401, (Enero 2022)
accedaCRIS portal de investigación de la Universidad de las Palmas de Gran Canaria
instname
Mathematical Biosciences and Engineering, Vol 19, Iss 4, Pp 3369-3401 (2022)
CONICET Digital (CONICET)
Consejo Nacional de Investigaciones Científicas y TécnicasSchlagwörter: Overlapping Solutions, Metric (unit), 02 engineering and technology, Bi-Objective Knapsack Problem, Engineering, Sociology, 0202 electrical engineering, electronic engineering, information engineering, Optimization problem, Constraint Handling, 12 Matemáticas, Multi-Objective Optimization, Mathematical optimization, Knapsack problem, FOS: Sociology, Algorithm, Operations management, Computational Theory and Mathematics, Application of Genetic Programming in Machine Learning, Physical Sciences, overlapping solutions, multi-objective evolutionary algorithms, Biotechnology, Objective Space Division, Population, 0206 medical engineering, bi-objective knapsack problem, Geometry, Space (punctuation), MULTI-OBJECTIVE COMBINATORIAL OPTIMIZATION PROBLEMS, objective space division, Point (geometry), Artificial Intelligence, Evolutionary algorithm, Multi-Objective Combinatorial Optimization Problems, QA1-939, FOS: Mathematics, MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS, Swarm Intelligence Optimization Algorithms, multi-objective combinatorial optimization problems, Demography, Global Optimization, Arithmetic, Multi-Objective Evolutionary Algorithms, OVERLAPPING SOLUTIONS, Division (mathematics), Computer science, Multi-objective optimization, Operating system, OBJECTIVE SPACE DIVISION, Computer Science, Multiobjective Optimization in Evolutionary Algorithms, TP248.13-248.65, Mathematics, BI-OBJECTIVE KNAPSACK PROBLEM
Dateibeschreibung: application/pdf
-
2
Autoren: et al.
Quelle: BURJC-Digital. Repositorio Institucional de la Universidad Rey Juan Carlos
Universidad Rey Juan CarlosSchlagwörter: Organizational Behavior and Human Resource Management, 0211 other engineering and technologies, Social Sciences, Business, Management and Accounting, 02 engineering and technology, Industrial and Manufacturing Engineering, p-Median problem, Design and Control of Warehouse Operations, Engineering, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Multi-objective combinatorial optimization problems, Dynamic Facility Layout, p-Dispersion problem, Reactive path relinking, Physics, Mathematical optimization, Optics, Building and Construction, Path (computing), Computer science, Dispersion (optics), Programming language, Algorithm, Humanitarian Logistics and Disaster Relief Operations Management, Physical Sciences, Challenges and Innovations in Urban Logistics Systems, Mathematics
Dateibeschreibung: application/pdf
Zugangs-URL: https://hdl.handle.net/10115/24568
-
3
Résolution de problèmes d'optimisation combinatoire mono et multi-objectifs par énumération ordonnée
Autoren: Belhoul, Lyes
Schlagwörter: Énumération ordonnée, Branch and Bound, Problèmes d'optimisation combinatoire mono et multi-Objectifs, Problème d'affectation, Problème du voyageur de commerce asymétrique, Ordered Enumeration, Mono and Multi-Objective Combinatorial Optimization Problems, Assignment Problem, Asymmetric Travelling Salesman Problem, jel:C61
-
4
Autoren: Kaddani, Sami
Thesis Advisors: Paris Sciences et Lettres, Vanderpooten, Daniel
Schlagwörter: Optimisation multi-Objectifs, Relation partielle de préférence, Problème d'optimisation combinatoire multi-Objectifs, Multi-Objective optimization, Partial preference relation, Multi-Objective combinatorial optimization problems, 003
Verfügbarkeit: http://www.theses.fr/2017PSLED012/document
-
5
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://theses.hal.science/tel-01827021 ; Other [cs.OH]. Université Paris sciences et lettres, 2017. English. ⟨NNT : 2017PSLED012⟩.
Schlagwörter: Multi-Objective optimization, Partial preference relation, Multi-Objective combinatorial optimization problems, Optimisation multi-Objectifs, Relation partielle de préférence, Problème d'optimisation combinatoire multi-Objectifs, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]
Relation: NNT: 2017PSLED012
-
6
Autoren: et al.
Weitere Verfasser: et al.
Quelle: https://theses.hal.science/tel-01127114 ; Autre [cs.OH]. Université Paris Dauphine - Paris IX, 2014. Français. ⟨NNT : 2014PA090060⟩.
Schlagwörter: Ordered Enumeration, Branch and Bound, Mono and Multi-Objective Combinatorial Optimization Problems, Assignment Problem, Asymmetric Travelling Salesman Problem, Énumération ordonnée, Problèmes d’optimisation combinatoire mono et multi-Objectifs, Problème d’affectation, Problème du voyageur de commerce asymétrique, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]
Relation: NNT: 2014PA090060
-
7
Autoren:
Weitere Verfasser:
Schlagwörter: Énumération ordonnée, Branch and Bound, Problèmes d’optimisation combinatoire mono et multi-Objectifs, Problème d’affectation, Problème du voyageur de commerce asymétrique, Ordered Enumeration, Mono and Multi-Objective Combinatorial Optimization Problems, Assignment Problem, Asymmetric Travelling Salesman Problem
Time: 004
Verfügbarkeit: http://www.theses.fr/2014PA090060/document
-
8
Autoren: et al.
Schlagwörter: BI-OBJECTIVE KNAPSACK PROBLEM, MULTI-OBJECTIVE COMBINATORIAL OPTIMIZATION PROBLEMS, MULTI-OBJECTIVE EVOLUTIONARY ALGORITHMS, OBJECTIVE SPACE DIVISION, OVERLAPPING SOLUTIONS, https://purl.org/becyt/ford/2.11, https://purl.org/becyt/ford/2
Dateibeschreibung: application/pdf
Relation: http://hdl.handle.net/11336/197965; CONICET Digital; CONICET
Verfügbarkeit: http://hdl.handle.net/11336/197965
Full Text Finder 
Nájsť tento článok vo Web of Science