يعرض 1 - 10 نتائج من 247 نتيجة بحث عن '"Baïou, Mourad"', وقت الاستعلام: 0.80s تنقيح النتائج
  1. 1
    تقرير
    Horizontal collaboration in forestry: game theory models and algorithms for trading demands

    المؤلفون: Baïou, Mourad, Oriolo, Gianpaolo, Stauffer, Gautier

    مصطلحات موضوعية: Computer Science - Computer Science and Game Theory, Computer Science - Discrete Mathematics, Mathematics - Optimization and Control

    الوصول الحر: http://arxiv.org/abs/2211.04105Test

    View record in Arxiv

    أضف إلى المفضلة
  2. 2
    مؤتمر
    Proportional Fairness for Combinatorial Optimization

    المؤلفون: Nguyen, Minh, Hieu, Baiou, Mourad, Nguyen, Viet, Hung, Vo, Thi Quynh Trang

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA)

    المصدر: Latin American Theoretical Informatics Symposium (LATIN 2024) ; https://hal.science/hal-04240500Test ; Latin American Theoretical Informatics Symposium (LATIN 2024), Mar 2024, Puerto Varas, Chile

    مصطلحات موضوعية: Bi-Objective Combinatorial Optimization, Nash Bargaining Solution, Proportional Fairness, Binary Search Algorithm, Bi-Objective Spanning Tree Problem, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]

    جغرافية الموضوع: Puerto Varas, Chile

    الوقت: Puerto Varas, Chile

    العلاقة: hal-04240500; https://hal.science/hal-04240500Test; https://hal.science/hal-04240500v2/documentTest; https://hal.science/hal-04240500v2/file/Proportional%20Fairness%20for%20Combinatorial%20Optimization.pdfTest

    الإتاحة: https://hal.science/hal-04240500Test
    https://hal.science/hal-04240500v2/documentTest
    https://hal.science/hal-04240500v2/file/Proportional%20Fairness%20for%20Combinatorial%20Optimization.pdfTest

    View record in BASE

    أضف إلى المفضلة
  3. 3
    تقرير
    On some algorithmic aspects of hypergraphic matroids

    المؤلفون: Baiou, Mourad, Barahona, Francisco

    مصطلحات موضوعية: Mathematics - Combinatorics, Mathematics - Optimization and Control

    الوصول الحر: http://arxiv.org/abs/2111.05699Test

    View record in Arxiv

    أضف إلى المفضلة
  4. 4
    تقرير
    Generalized Nash Fairness solutions for Bi-Objective Discrete Optimization: Theory and Algorithms

    المؤلفون: Nguyen, Minh, Hieu, Baiou, Mourad, Nguyen, Viet, Hung

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA)

    المصدر: https://hal.science/hal-04010827Test ; 2024.

    مصطلحات موضوعية: Bi-Objective Discrete Optimization, Bi-Criteria Decision Making, Pareto optimal, Proportional Fairness, Generalized Nash Fairness solution, [INFO]Computer Science [cs], [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]

    العلاقة: hal-04010827; https://hal.science/hal-04010827Test; https://hal.science/hal-04010827v2/documentTest; https://hal.science/hal-04010827v2/file/DAM.pdfTest

    الإتاحة: https://hal.science/hal-04010827Test
    https://hal.science/hal-04010827v2/documentTest
    https://hal.science/hal-04010827v2/file/DAM.pdfTest

    View record in BASE

    أضف إلى المفضلة
  5. 5
    مؤتمر
    Improving Subtour Elimination Constraint Generation in Branch-and-Cut Algorithms for the TSP with Machine Learning

    المؤلفون: Vo, Thi Quynh Trang, Baiou, Mourad, Nguyen, Viet, Hung, Weng, Paul

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Shanghai Jiao Tong University Shanghai, This work has been supported in part by the program of National Natural Science Foundation of China (No. 62176154).

    المصدر: 17th learning and intelligent optimization conference
    https://hal.science/hal-04102680Test
    17th learning and intelligent optimization conference, Jun 2023, Nice, France

    مصطلحات موضوعية: Traveling Salesman Problem, Subtour elimination constraints, Branch-and-Cut, Cut generation, Machine Learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

    جغرافية الموضوع: Nice, France

    الوقت: Nice, France

    العلاقة: hal-04102680; https://hal.science/hal-04102680Test; https://hal.science/hal-04102680/documentTest; https://hal.science/hal-04102680/file/Improving%20Subtour%20Elimination%20Constraint%20Generation%20in%20Branch-and-Cut%20Algorithms%20for%20the%20TSP%20with%20Machine%20Learning%20.pdfTest

    الإتاحة: https://hal.science/hal-04102680Test
    https://hal.science/hal-04102680/documentTest
    https://hal.science/hal-04102680/file/Improving%20Subtour%20Elimination%20Constraint%20Generation%20in%20Branch-and-Cut%20Algorithms%20for%20the%20TSP%20with%20Machine%20Learning%20.pdfTest

    View record in BASE

    أضف إلى المفضلة
  6. 6
    مؤتمر
    A Comparison of Several Speed Computation Methods for the Safe Shortest Path Problem

    المؤلفون: Mombelli, Aurélien, Quilliot, Alain, Baiou, Mourad

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA)

    المصدر: ISSN: 2184-4372 ; Proceedings of the 12th International Conference on Operations Research and Enterprise Systems (ICORES 2023) ; https://uca.hal.science/hal-04152104Test ; Proceedings of the 12th International Conference on Operations Research and Enterprise Systems (ICORES 2023), SCITEPRESS - Science and Technology Publications, pp.15-26, 2023, 978-989-758-627-9. ⟨10.5220/0011618600003396⟩.

    مصطلحات موضوعية: Dynamic Programming, Risk Aware, Time-dependant, Reinforcement Learning, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]

    العلاقة: hal-04152104; https://uca.hal.science/hal-04152104Test; https://uca.hal.science/hal-04152104/documentTest; https://uca.hal.science/hal-04152104/file/SSPP_2_ICORES.pdfTest

    الإتاحة: https://doi.org/10.5220/0011618600003396Test
    https://uca.hal.science/hal-04152104Test
    https://uca.hal.science/hal-04152104/documentTest
    https://uca.hal.science/hal-04152104/file/SSPP_2_ICORES.pdfTest

    View record in BASE

    أضف إلى المفضلة
  7. 7
    دورية أكاديمية
    On some algorithmic aspects of hypergraphic matroids

    المؤلفون: Baïou, Mourad, Barahona, Francisco

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Université Clermont Auvergne 2017-2020 (UCA 2017-2020 )-Centre National de la Recherche Scientifique (CNRS), IBM Thomas J. Watson Research Center, IBM

    المصدر: ISSN: 0012-365X ; Discrete Mathematics ; https://hal.science/hal-03872592Test ; Discrete Mathematics, 2023, 346 (2), pp.113222. ⟨10.1016/j.disc.2022.113222⟩.

    مصطلحات موضوعية: [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

    العلاقة: info:eu-repo/semantics/altIdentifier/arxiv/2111.05699; hal-03872592; https://hal.science/hal-03872592Test; https://hal.science/hal-03872592/documentTest; https://hal.science/hal-03872592/file/hmatroid.pdfTest; ARXIV: 2111.05699

    الإتاحة: https://doi.org/10.1016/j.disc.2022.113222Test
    https://hal.science/hal-03872592Test
    https://hal.science/hal-03872592/documentTest
    https://hal.science/hal-03872592/file/hmatroid.pdfTest

    View record in BASE

    أضف إلى المفضلة
  8. 8
    دورية أكاديمية
    Generalized Nash Fairness solutions for Bi-Objective Minimization Problems

    المؤلفون: Nguyen, Minh, Hieu, Baiou, Mourad, Nguyen, Viet Hung, Vo, Thi Quynh Trang

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA)

    المصدر: ISSN: 0028-3045.

    مصطلحات موضوعية: Proportional Fairness, Bi-Objective Travelling Salesman Problem, Bi-Objective Shortest Path Problem, Bi-Objective Optimization, Bi-Criteria Decision Making, Pareto optimal, Weighted Sum Method, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

    العلاقة: hal-03890300; https://hal.science/hal-03890300Test; https://hal.science/hal-03890300v3/documentTest; https://hal.science/hal-03890300v3/file/Generalized%20Nash%20Fairness%20solutions%20for%20Bi-Ovjective%20Minimization%20Problems.pdfTest

    الإتاحة: https://doi.org/10.1002/net.22182Test
    https://hal.science/hal-03890300Test
    https://hal.science/hal-03890300v3/documentTest
    https://hal.science/hal-03890300v3/file/Generalized%20Nash%20Fairness%20solutions%20for%20Bi-Ovjective%20Minimization%20Problems.pdfTest

    View record in BASE

    أضف إلى المفضلة
  9. 9
    دورية أكاديمية
    Complexity, algorithmic, and computational aspects of a dial-a-ride type problem

    المؤلفون: Baïou, Mourad, Colares, Rafael, Kerivin, Hervé

    المساهمون: French National Research Agency

    المصدر: European Journal of Operational Research ; volume 310, issue 2, page 552-565 ; ISSN 0377-2217

    مصطلحات موضوعية: Information Systems and Management, Management Science and Operations Research, Modeling and Simulation, General Computer Science, Industrial and Manufacturing Engineering

    الإتاحة: https://doi.org/10.1016/j.ejor.2023.03.018Test
    https://api.elsevier.com/content/article/PII:S0377221723002242?httpAccept=text/xmlTest
    https://api.elsevier.com/content/article/PII:S0377221723002242?httpAccept=text/plainTest

    View record in BASE

    أضف إلى المفضلة
  10. 10
    مؤتمر
    Nash balanced assignment problem

    المؤلفون: Nguyen, Minh Hieu, Baiou, Mourad, Nguyen, Viet Hung

    المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), INSA Lyon

    المصدر: 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision
    https://hal.science/hal-03596199Test
    23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France

    مصطلحات موضوعية: combinatorial optimization, balanced assignment problem, matching problem, computational complexity, Nash fairness, Weighted Sum Method, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

    جغرافية الموضوع: Villeurbanne - Lyon, France

    العلاقة: hal-03596199; https://hal.science/hal-03596199Test; https://hal.science/hal-03596199/documentTest; https://hal.science/hal-03596199/file/Abstract_ROADEF_2022.pdfTest

    الإتاحة: https://hal.science/hal-03596199Test
    https://hal.science/hal-03596199/documentTest
    https://hal.science/hal-03596199/file/Abstract_ROADEF_2022.pdfTest

    View record in BASE

    أضف إلى المفضلة
أدوات البحث: أحصل على تغذية RSS — أرسل هذا البحث بالبريد الإلكتروني — حفظ البحث